TSTP Solution File: SYN207-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN207-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:29:35 EDT 2023
% Result : Unsatisfiable 0.89s 0.59s
% Output : CNFRefutation 0.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of clauses : 49 ( 23 unt; 0 nHn; 38 RR)
% Number of literals : 94 ( 0 equ; 49 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 67 ( 29 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_093,axiom,
( q1(X1,X1,X1)
| ~ q0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.3w0AmtMTD3/E---3.1_31812.p',rule_093) ).
cnf(axiom_33,axiom,
q0(d,c),
file('/export/starexec/sandbox/tmp/tmp.3w0AmtMTD3/E---3.1_31812.p',axiom_33) ).
cnf(rule_126,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
file('/export/starexec/sandbox/tmp/tmp.3w0AmtMTD3/E---3.1_31812.p',rule_126) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/tmp/tmp.3w0AmtMTD3/E---3.1_31812.p',axiom_17) ).
cnf(rule_125,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.3w0AmtMTD3/E---3.1_31812.p',rule_125) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/tmp/tmp.3w0AmtMTD3/E---3.1_31812.p',axiom_14) ).
cnf(rule_184,axiom,
( q2(X1,X1,X1)
| ~ q1(X2,c,X1) ),
file('/export/starexec/sandbox/tmp/tmp.3w0AmtMTD3/E---3.1_31812.p',rule_184) ).
cnf(rule_273,axiom,
( s3(X1,X2)
| ~ q2(X3,X1,X3)
| ~ s2(X1)
| ~ m0(X3,X4,X2) ),
file('/export/starexec/sandbox/tmp/tmp.3w0AmtMTD3/E---3.1_31812.p',rule_273) ).
cnf(rule_133,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.3w0AmtMTD3/E---3.1_31812.p',rule_133) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/tmp/tmp.3w0AmtMTD3/E---3.1_31812.p',axiom_19) ).
cnf(prove_this,negated_conjecture,
~ s3(c,c),
file('/export/starexec/sandbox/tmp/tmp.3w0AmtMTD3/E---3.1_31812.p',prove_this) ).
cnf(rule_189,axiom,
( s2(X1)
| ~ q2(b,X1,b)
| ~ s1(b) ),
file('/export/starexec/sandbox/tmp/tmp.3w0AmtMTD3/E---3.1_31812.p',rule_189) ).
cnf(rule_183,axiom,
( q2(X1,c,X2)
| ~ k1(X2)
| ~ l0(c)
| ~ l2(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.3w0AmtMTD3/E---3.1_31812.p',rule_183) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox/tmp/tmp.3w0AmtMTD3/E---3.1_31812.p',axiom_24) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.3w0AmtMTD3/E---3.1_31812.p',rule_001) ).
cnf(axiom_7,axiom,
n0(d,b),
file('/export/starexec/sandbox/tmp/tmp.3w0AmtMTD3/E---3.1_31812.p',axiom_7) ).
cnf(c_0_16,axiom,
( q1(X1,X1,X1)
| ~ q0(X2,X1) ),
rule_093 ).
cnf(c_0_17,axiom,
q0(d,c),
axiom_33 ).
cnf(c_0_18,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
rule_126 ).
cnf(c_0_19,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_20,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
rule_125 ).
cnf(c_0_21,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_22,axiom,
( q2(X1,X1,X1)
| ~ q1(X2,c,X1) ),
rule_184 ).
cnf(c_0_23,plain,
q1(c,c,c),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
( s1(X1)
| ~ s1(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
s1(b),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,axiom,
( s3(X1,X2)
| ~ q2(X3,X1,X3)
| ~ s2(X1)
| ~ m0(X3,X4,X2) ),
rule_273 ).
cnf(c_0_27,plain,
q2(c,c,c),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
rule_133 ).
cnf(c_0_29,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
( s3(c,X1)
| ~ s2(c)
| ~ m0(c,X2,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_32,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ m0(X3,X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_33,negated_conjecture,
~ s3(c,c),
prove_this ).
cnf(c_0_34,plain,
( s3(c,X1)
| ~ s2(c) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,axiom,
( s2(X1)
| ~ q2(b,X1,b)
| ~ s1(b) ),
rule_189 ).
cnf(c_0_36,axiom,
( q2(X1,c,X2)
| ~ k1(X2)
| ~ l0(c)
| ~ l2(X2,X1) ),
rule_183 ).
cnf(c_0_37,axiom,
l0(c),
axiom_24 ).
cnf(c_0_38,plain,
( l2(X1,X1)
| ~ p0(X2,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_31]) ).
cnf(c_0_39,negated_conjecture,
~ s2(c),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,plain,
( s2(X1)
| ~ q2(b,X1,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_25])]) ).
cnf(c_0_41,plain,
( q2(X1,c,X2)
| ~ l2(X2,X1)
| ~ k1(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_42,plain,
l2(X1,X1),
inference(spm,[status(thm)],[c_0_38,c_0_21]) ).
cnf(c_0_43,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
rule_001 ).
cnf(c_0_44,axiom,
n0(d,b),
axiom_7 ).
cnf(c_0_45,negated_conjecture,
~ q2(b,c,b),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,plain,
( q2(X1,c,X1)
| ~ k1(X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
k1(b),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN207-1 : TPTP v8.1.2. Released v1.1.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Oct 2 19:06:52 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.3w0AmtMTD3/E---3.1_31812.p
% 0.89/0.59 # Version: 3.1pre001
% 0.89/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.89/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.89/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.89/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.89/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.89/0.59 # Starting sh5l with 300s (1) cores
% 0.89/0.59 # new_bool_3 with pid 31891 completed with status 0
% 0.89/0.59 # Result found by new_bool_3
% 0.89/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.89/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.89/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.89/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.89/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.89/0.59 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.89/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.89/0.59 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.89/0.59 # SAT001_MinMin_p005000_rr_RG with pid 31899 completed with status 0
% 0.89/0.59 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.89/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.89/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.89/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.89/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.89/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.89/0.59 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.89/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.89/0.59 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.89/0.59 # Preprocessing time : 0.005 s
% 0.89/0.59 # Presaturation interreduction done
% 0.89/0.59
% 0.89/0.59 # Proof found!
% 0.89/0.59 # SZS status Unsatisfiable
% 0.89/0.59 # SZS output start CNFRefutation
% See solution above
% 0.89/0.59 # Parsed axioms : 369
% 0.89/0.59 # Removed by relevancy pruning/SinE : 24
% 0.89/0.59 # Initial clauses : 345
% 0.89/0.59 # Removed in clause preprocessing : 6
% 0.89/0.59 # Initial clauses in saturation : 339
% 0.89/0.59 # Processed clauses : 1083
% 0.89/0.59 # ...of these trivial : 62
% 0.89/0.59 # ...subsumed : 54
% 0.89/0.59 # ...remaining for further processing : 967
% 0.89/0.59 # Other redundant clauses eliminated : 0
% 0.89/0.59 # Clauses deleted for lack of memory : 0
% 0.89/0.59 # Backward-subsumed : 59
% 0.89/0.59 # Backward-rewritten : 232
% 0.89/0.59 # Generated clauses : 1437
% 0.89/0.59 # ...of the previous two non-redundant : 912
% 0.89/0.59 # ...aggressively subsumed : 0
% 0.89/0.59 # Contextual simplify-reflections : 2
% 0.89/0.59 # Paramodulations : 1437
% 0.89/0.59 # Factorizations : 0
% 0.89/0.59 # NegExts : 0
% 0.89/0.59 # Equation resolutions : 0
% 0.89/0.59 # Total rewrite steps : 1138
% 0.89/0.59 # Propositional unsat checks : 0
% 0.89/0.59 # Propositional check models : 0
% 0.89/0.59 # Propositional check unsatisfiable : 0
% 0.89/0.59 # Propositional clauses : 0
% 0.89/0.59 # Propositional clauses after purity: 0
% 0.89/0.59 # Propositional unsat core size : 0
% 0.89/0.59 # Propositional preprocessing time : 0.000
% 0.89/0.59 # Propositional encoding time : 0.000
% 0.89/0.59 # Propositional solver time : 0.000
% 0.89/0.59 # Success case prop preproc time : 0.000
% 0.89/0.59 # Success case prop encoding time : 0.000
% 0.89/0.59 # Success case prop solver time : 0.000
% 0.89/0.59 # Current number of processed clauses : 371
% 0.89/0.59 # Positive orientable unit clauses : 171
% 0.89/0.59 # Positive unorientable unit clauses: 0
% 0.89/0.59 # Negative unit clauses : 3
% 0.89/0.59 # Non-unit-clauses : 197
% 0.89/0.59 # Current number of unprocessed clauses: 334
% 0.89/0.59 # ...number of literals in the above : 949
% 0.89/0.59 # Current number of archived formulas : 0
% 0.89/0.59 # Current number of archived clauses : 596
% 0.89/0.59 # Clause-clause subsumption calls (NU) : 41973
% 0.89/0.59 # Rec. Clause-clause subsumption calls : 30186
% 0.89/0.59 # Non-unit clause-clause subsumptions : 90
% 0.89/0.59 # Unit Clause-clause subsumption calls : 2767
% 0.89/0.59 # Rewrite failures with RHS unbound : 0
% 0.89/0.59 # BW rewrite match attempts : 467
% 0.89/0.59 # BW rewrite match successes : 152
% 0.89/0.59 # Condensation attempts : 0
% 0.89/0.59 # Condensation successes : 0
% 0.89/0.59 # Termbank termtop insertions : 24790
% 0.89/0.59
% 0.89/0.59 # -------------------------------------------------
% 0.89/0.59 # User time : 0.078 s
% 0.89/0.59 # System time : 0.005 s
% 0.89/0.59 # Total time : 0.083 s
% 0.89/0.59 # Maximum resident set size: 2496 pages
% 0.89/0.59
% 0.89/0.59 # -------------------------------------------------
% 0.89/0.59 # User time : 0.084 s
% 0.89/0.59 # System time : 0.007 s
% 0.89/0.59 # Total time : 0.091 s
% 0.89/0.59 # Maximum resident set size: 2000 pages
% 0.89/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------