TSTP Solution File: SYN214-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN214-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:36 EDT 2023
% Result : Unsatisfiable 0.18s 0.55s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 17
% Syntax : Number of clauses : 50 ( 25 unt; 0 nHn; 38 RR)
% Number of literals : 90 ( 0 equ; 42 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 15 ( 14 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 80 ( 42 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_014,axiom,
( m1(X1,X1,X1)
| ~ m0(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.FuDCF5Rpxw/E---3.1_13109.p',rule_014) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox2/tmp/tmp.FuDCF5Rpxw/E---3.1_13109.p',axiom_19) ).
cnf(rule_003,axiom,
( l1(X1,X2)
| ~ p0(X3,X1)
| ~ r0(X4)
| ~ m0(X2,X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.FuDCF5Rpxw/E---3.1_13109.p',rule_003) ).
cnf(axiom_27,axiom,
m0(e,b,c),
file('/export/starexec/sandbox2/tmp/tmp.FuDCF5Rpxw/E---3.1_13109.p',axiom_27) ).
cnf(axiom_18,axiom,
p0(c,b),
file('/export/starexec/sandbox2/tmp/tmp.FuDCF5Rpxw/E---3.1_13109.p',axiom_18) ).
cnf(rule_150,axiom,
( p2(X1,X1,X1)
| ~ m1(X2,X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.FuDCF5Rpxw/E---3.1_13109.p',rule_150) ).
cnf(axiom_9,axiom,
r0(b),
file('/export/starexec/sandbox2/tmp/tmp.FuDCF5Rpxw/E---3.1_13109.p',axiom_9) ).
cnf(rule_248,axiom,
( p3(X1,X1,X1)
| ~ p2(X2,X1,X1)
| ~ n3(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.FuDCF5Rpxw/E---3.1_13109.p',rule_248) ).
cnf(rule_240,axiom,
( n3(X1)
| ~ p2(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.FuDCF5Rpxw/E---3.1_13109.p',rule_240) ).
cnf(rule_186,axiom,
( q2(X1,X1,X2)
| ~ l1(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.FuDCF5Rpxw/E---3.1_13109.p',rule_186) ).
cnf(rule_298,axiom,
( r4(X1)
| ~ n3(X1)
| ~ q3(X2,X3)
| ~ p0(X4,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.FuDCF5Rpxw/E---3.1_13109.p',rule_298) ).
cnf(rule_255,axiom,
( q3(X1,X2)
| ~ q2(X3,X1,X2)
| ~ n0(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.FuDCF5Rpxw/E---3.1_13109.p',rule_255) ).
cnf(axiom_30,axiom,
n0(e,e),
file('/export/starexec/sandbox2/tmp/tmp.FuDCF5Rpxw/E---3.1_13109.p',axiom_30) ).
cnf(rule_277,axiom,
( l4(X1)
| ~ p3(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.FuDCF5Rpxw/E---3.1_13109.p',rule_277) ).
cnf(rule_329,axiom,
( s5(X1)
| ~ l4(X1)
| ~ r4(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.FuDCF5Rpxw/E---3.1_13109.p',rule_329) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/tmp/tmp.FuDCF5Rpxw/E---3.1_13109.p',axiom_14) ).
cnf(prove_this,negated_conjecture,
~ s5(c),
file('/export/starexec/sandbox2/tmp/tmp.FuDCF5Rpxw/E---3.1_13109.p',prove_this) ).
cnf(c_0_17,axiom,
( m1(X1,X1,X1)
| ~ m0(X2,X3,X1) ),
rule_014 ).
cnf(c_0_18,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_19,axiom,
( l1(X1,X2)
| ~ p0(X3,X1)
| ~ r0(X4)
| ~ m0(X2,X1,X3) ),
rule_003 ).
cnf(c_0_20,axiom,
m0(e,b,c),
axiom_27 ).
cnf(c_0_21,axiom,
p0(c,b),
axiom_18 ).
cnf(c_0_22,axiom,
( p2(X1,X1,X1)
| ~ m1(X2,X2,X1) ),
rule_150 ).
cnf(c_0_23,plain,
m1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
( l1(b,e)
| ~ r0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_25,axiom,
r0(b),
axiom_9 ).
cnf(c_0_26,axiom,
( p3(X1,X1,X1)
| ~ p2(X2,X1,X1)
| ~ n3(X1) ),
rule_248 ).
cnf(c_0_27,axiom,
( n3(X1)
| ~ p2(X2,X3,X1) ),
rule_240 ).
cnf(c_0_28,plain,
p2(X1,X1,X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,axiom,
( q2(X1,X1,X2)
| ~ l1(X2,X1) ),
rule_186 ).
cnf(c_0_30,plain,
l1(b,e),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( p3(X1,X1,X1)
| ~ p2(X2,X1,X1) ),
inference(csr,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,axiom,
( r4(X1)
| ~ n3(X1)
| ~ q3(X2,X3)
| ~ p0(X4,X1) ),
rule_298 ).
cnf(c_0_33,plain,
n3(X1),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,axiom,
( q3(X1,X2)
| ~ q2(X3,X1,X2)
| ~ n0(X3,X1) ),
rule_255 ).
cnf(c_0_35,plain,
q2(e,e,b),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,axiom,
n0(e,e),
axiom_30 ).
cnf(c_0_37,axiom,
( l4(X1)
| ~ p3(X2,X3,X1) ),
rule_277 ).
cnf(c_0_38,plain,
p3(X1,X1,X1),
inference(spm,[status(thm)],[c_0_31,c_0_28]) ).
cnf(c_0_39,plain,
( r4(X1)
| ~ q3(X2,X3)
| ~ p0(X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_40,plain,
q3(e,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_41,axiom,
( s5(X1)
| ~ l4(X1)
| ~ r4(X2) ),
rule_329 ).
cnf(c_0_42,plain,
l4(X1),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,plain,
( r4(X1)
| ~ p0(X2,X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_45,plain,
( s5(X1)
| ~ r4(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]) ).
cnf(c_0_46,plain,
r4(X1),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
~ s5(c),
prove_this ).
cnf(c_0_48,plain,
s5(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : SYN214-1 : TPTP v8.1.2. Released v1.1.0.
% 0.08/0.13 % Command : run_E %s %d THM
% 0.11/0.34 % Computer : n026.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 2400
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Mon Oct 2 18:22:29 EDT 2023
% 0.11/0.34 % CPUTime :
% 0.18/0.48 Running first-order model finding
% 0.18/0.48 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.FuDCF5Rpxw/E---3.1_13109.p
% 0.18/0.55 # Version: 3.1pre001
% 0.18/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.55 # Starting sh5l with 300s (1) cores
% 0.18/0.55 # new_bool_1 with pid 13190 completed with status 0
% 0.18/0.55 # Result found by new_bool_1
% 0.18/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.55 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.18/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.55 # SAT001_MinMin_p005000_rr_RG with pid 13193 completed with status 0
% 0.18/0.55 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.55 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.55 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.55 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.55 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.55 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.55 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.18/0.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.55 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.55 # Preprocessing time : 0.004 s
% 0.18/0.55 # Presaturation interreduction done
% 0.18/0.55
% 0.18/0.55 # Proof found!
% 0.18/0.55 # SZS status Unsatisfiable
% 0.18/0.55 # SZS output start CNFRefutation
% See solution above
% 0.18/0.55 # Parsed axioms : 369
% 0.18/0.55 # Removed by relevancy pruning/SinE : 50
% 0.18/0.55 # Initial clauses : 319
% 0.18/0.55 # Removed in clause preprocessing : 7
% 0.18/0.55 # Initial clauses in saturation : 312
% 0.18/0.55 # Processed clauses : 814
% 0.18/0.55 # ...of these trivial : 50
% 0.18/0.55 # ...subsumed : 28
% 0.18/0.55 # ...remaining for further processing : 736
% 0.18/0.55 # Other redundant clauses eliminated : 0
% 0.18/0.55 # Clauses deleted for lack of memory : 0
% 0.18/0.55 # Backward-subsumed : 23
% 0.18/0.55 # Backward-rewritten : 177
% 0.18/0.55 # Generated clauses : 786
% 0.18/0.55 # ...of the previous two non-redundant : 525
% 0.18/0.55 # ...aggressively subsumed : 0
% 0.18/0.55 # Contextual simplify-reflections : 2
% 0.18/0.55 # Paramodulations : 786
% 0.18/0.55 # Factorizations : 0
% 0.18/0.55 # NegExts : 0
% 0.18/0.55 # Equation resolutions : 0
% 0.18/0.55 # Total rewrite steps : 669
% 0.18/0.55 # Propositional unsat checks : 0
% 0.18/0.55 # Propositional check models : 0
% 0.18/0.55 # Propositional check unsatisfiable : 0
% 0.18/0.55 # Propositional clauses : 0
% 0.18/0.55 # Propositional clauses after purity: 0
% 0.18/0.55 # Propositional unsat core size : 0
% 0.18/0.55 # Propositional preprocessing time : 0.000
% 0.18/0.55 # Propositional encoding time : 0.000
% 0.18/0.55 # Propositional solver time : 0.000
% 0.18/0.55 # Success case prop preproc time : 0.000
% 0.18/0.55 # Success case prop encoding time : 0.000
% 0.18/0.55 # Success case prop solver time : 0.000
% 0.18/0.55 # Current number of processed clauses : 255
% 0.18/0.55 # Positive orientable unit clauses : 97
% 0.18/0.55 # Positive unorientable unit clauses: 0
% 0.18/0.55 # Negative unit clauses : 0
% 0.18/0.55 # Non-unit-clauses : 158
% 0.18/0.55 # Current number of unprocessed clauses: 260
% 0.18/0.55 # ...number of literals in the above : 710
% 0.18/0.55 # Current number of archived formulas : 0
% 0.18/0.55 # Current number of archived clauses : 481
% 0.18/0.55 # Clause-clause subsumption calls (NU) : 34046
% 0.18/0.55 # Rec. Clause-clause subsumption calls : 23411
% 0.18/0.55 # Non-unit clause-clause subsumptions : 49
% 0.18/0.55 # Unit Clause-clause subsumption calls : 2674
% 0.18/0.55 # Rewrite failures with RHS unbound : 0
% 0.18/0.55 # BW rewrite match attempts : 269
% 0.18/0.55 # BW rewrite match successes : 122
% 0.18/0.55 # Condensation attempts : 0
% 0.18/0.55 # Condensation successes : 0
% 0.18/0.55 # Termbank termtop insertions : 17732
% 0.18/0.55
% 0.18/0.55 # -------------------------------------------------
% 0.18/0.55 # User time : 0.051 s
% 0.18/0.55 # System time : 0.004 s
% 0.18/0.55 # Total time : 0.055 s
% 0.18/0.55 # Maximum resident set size: 2464 pages
% 0.18/0.55
% 0.18/0.55 # -------------------------------------------------
% 0.18/0.55 # User time : 0.056 s
% 0.18/0.55 # System time : 0.006 s
% 0.18/0.55 # Total time : 0.062 s
% 0.18/0.55 # Maximum resident set size: 2000 pages
% 0.18/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------