TSTP Solution File: SYN111-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN111-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 20:13:49 EDT 2023
% Result : Unsatisfiable 0.23s 0.59s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 27 ( 15 unt; 0 nHn; 23 RR)
% Number of literals : 47 ( 0 equ; 23 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 30 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_021,axiom,
( m1(X1,X2,X1)
| ~ l0(X1)
| ~ k0(X2) ),
file('/export/starexec/sandbox/tmp/tmp.wqJxQzSgbh/E---3.1_7758.p',rule_021) ).
cnf(axiom_32,axiom,
k0(b),
file('/export/starexec/sandbox/tmp/tmp.wqJxQzSgbh/E---3.1_7758.p',axiom_32) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox/tmp/tmp.wqJxQzSgbh/E---3.1_7758.p',axiom_24) ).
cnf(rule_107,axiom,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
file('/export/starexec/sandbox/tmp/tmp.wqJxQzSgbh/E---3.1_7758.p',rule_107) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/tmp/tmp.wqJxQzSgbh/E---3.1_7758.p',axiom_19) ).
cnf(rule_127,axiom,
( k2(X1,X2)
| ~ m1(X3,X2,X1)
| ~ k1(X4)
| ~ k2(X4,X2) ),
file('/export/starexec/sandbox/tmp/tmp.wqJxQzSgbh/E---3.1_7758.p',rule_127) ).
cnf(prove_this,negated_conjecture,
~ k2(c,b),
file('/export/starexec/sandbox/tmp/tmp.wqJxQzSgbh/E---3.1_7758.p',prove_this) ).
cnf(rule_129,axiom,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.wqJxQzSgbh/E---3.1_7758.p',rule_129) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.wqJxQzSgbh/E---3.1_7758.p',rule_001) ).
cnf(axiom_7,axiom,
n0(d,b),
file('/export/starexec/sandbox/tmp/tmp.wqJxQzSgbh/E---3.1_7758.p',axiom_7) ).
cnf(c_0_10,axiom,
( m1(X1,X2,X1)
| ~ l0(X1)
| ~ k0(X2) ),
rule_021 ).
cnf(c_0_11,axiom,
k0(b),
axiom_32 ).
cnf(c_0_12,plain,
( m1(X1,b,X1)
| ~ l0(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
l0(c),
axiom_24 ).
cnf(c_0_14,axiom,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
rule_107 ).
cnf(c_0_15,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_16,axiom,
( k2(X1,X2)
| ~ m1(X3,X2,X1)
| ~ k1(X4)
| ~ k2(X4,X2) ),
rule_127 ).
cnf(c_0_17,plain,
m1(c,b,c),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
~ k2(c,b),
prove_this ).
cnf(c_0_19,axiom,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
rule_129 ).
cnf(c_0_20,plain,
q1(e,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15])]) ).
cnf(c_0_21,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
rule_001 ).
cnf(c_0_22,axiom,
n0(d,b),
axiom_7 ).
cnf(c_0_23,plain,
( ~ k2(X1,b)
| ~ k1(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_24,plain,
k2(X1,X1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
k1(b),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SYN111-1 : TPTP v8.1.2. Released v1.1.0.
% 0.07/0.16 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n018.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 2400
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon Oct 2 18:30:39 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.wqJxQzSgbh/E---3.1_7758.p
% 0.23/0.59 # Version: 3.1pre001
% 0.23/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.23/0.59 # Starting sh5l with 300s (1) cores
% 0.23/0.59 # new_bool_3 with pid 7837 completed with status 0
% 0.23/0.59 # Result found by new_bool_3
% 0.23/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.59 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.23/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.59 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.23/0.59 # SAT001_MinMin_p005000_rr_RG with pid 7844 completed with status 0
% 0.23/0.59 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.23/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.23/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.59 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.23/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.59 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.23/0.59 # Preprocessing time : 0.005 s
% 0.23/0.59 # Presaturation interreduction done
% 0.23/0.59
% 0.23/0.59 # Proof found!
% 0.23/0.59 # SZS status Unsatisfiable
% 0.23/0.59 # SZS output start CNFRefutation
% See solution above
% 0.23/0.59 # Parsed axioms : 369
% 0.23/0.59 # Removed by relevancy pruning/SinE : 41
% 0.23/0.59 # Initial clauses : 328
% 0.23/0.59 # Removed in clause preprocessing : 5
% 0.23/0.59 # Initial clauses in saturation : 323
% 0.23/0.59 # Processed clauses : 660
% 0.23/0.59 # ...of these trivial : 26
% 0.23/0.59 # ...subsumed : 24
% 0.23/0.59 # ...remaining for further processing : 610
% 0.23/0.59 # Other redundant clauses eliminated : 0
% 0.23/0.59 # Clauses deleted for lack of memory : 0
% 0.23/0.59 # Backward-subsumed : 11
% 0.23/0.59 # Backward-rewritten : 39
% 0.23/0.59 # Generated clauses : 447
% 0.23/0.59 # ...of the previous two non-redundant : 295
% 0.23/0.59 # ...aggressively subsumed : 0
% 0.23/0.59 # Contextual simplify-reflections : 1
% 0.23/0.59 # Paramodulations : 447
% 0.23/0.59 # Factorizations : 0
% 0.23/0.59 # NegExts : 0
% 0.23/0.59 # Equation resolutions : 0
% 0.23/0.59 # Total rewrite steps : 334
% 0.23/0.59 # Propositional unsat checks : 0
% 0.23/0.59 # Propositional check models : 0
% 0.23/0.59 # Propositional check unsatisfiable : 0
% 0.23/0.59 # Propositional clauses : 0
% 0.23/0.59 # Propositional clauses after purity: 0
% 0.23/0.59 # Propositional unsat core size : 0
% 0.23/0.59 # Propositional preprocessing time : 0.000
% 0.23/0.59 # Propositional encoding time : 0.000
% 0.23/0.59 # Propositional solver time : 0.000
% 0.23/0.59 # Success case prop preproc time : 0.000
% 0.23/0.59 # Success case prop encoding time : 0.000
% 0.23/0.59 # Success case prop solver time : 0.000
% 0.23/0.59 # Current number of processed clauses : 272
% 0.23/0.59 # Positive orientable unit clauses : 114
% 0.23/0.59 # Positive unorientable unit clauses: 0
% 0.23/0.59 # Negative unit clauses : 1
% 0.23/0.59 # Non-unit-clauses : 157
% 0.23/0.59 # Current number of unprocessed clauses: 236
% 0.23/0.59 # ...number of literals in the above : 605
% 0.23/0.59 # Current number of archived formulas : 0
% 0.23/0.59 # Current number of archived clauses : 338
% 0.23/0.59 # Clause-clause subsumption calls (NU) : 23982
% 0.23/0.59 # Rec. Clause-clause subsumption calls : 16980
% 0.23/0.59 # Non-unit clause-clause subsumptions : 29
% 0.23/0.59 # Unit Clause-clause subsumption calls : 178
% 0.23/0.59 # Rewrite failures with RHS unbound : 0
% 0.23/0.59 # BW rewrite match attempts : 72
% 0.23/0.59 # BW rewrite match successes : 37
% 0.23/0.59 # Condensation attempts : 0
% 0.23/0.59 # Condensation successes : 0
% 0.23/0.59 # Termbank termtop insertions : 13282
% 0.23/0.59
% 0.23/0.59 # -------------------------------------------------
% 0.23/0.59 # User time : 0.050 s
% 0.23/0.59 # System time : 0.003 s
% 0.23/0.59 # Total time : 0.053 s
% 0.23/0.59 # Maximum resident set size: 2476 pages
% 0.23/0.59
% 0.23/0.59 # -------------------------------------------------
% 0.23/0.59 # User time : 0.055 s
% 0.23/0.59 # System time : 0.006 s
% 0.23/0.59 # Total time : 0.061 s
% 0.23/0.59 # Maximum resident set size: 2000 pages
% 0.23/0.59 % E---3.1 exiting
% 0.23/0.60 % E---3.1 exiting
%------------------------------------------------------------------------------