TSTP Solution File: SYN129-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SYN129-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:52 EDT 2023
% Result : Unsatisfiable 0.18s 0.55s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of clauses : 37 ( 16 unt; 0 nHn; 27 RR)
% Number of literals : 65 ( 0 equ; 30 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 : 60 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_014,axiom,
( m1(X1,X1,X1)
| ~ m0(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.P6xx9rtt0W/E---3.1_8016.p',rule_014) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox2/tmp/tmp.P6xx9rtt0W/E---3.1_8016.p',axiom_19) ).
cnf(rule_150,axiom,
( p2(X1,X1,X1)
| ~ m1(X2,X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.P6xx9rtt0W/E---3.1_8016.p',rule_150) ).
cnf(rule_238,axiom,
( m3(X1,X1,X1)
| ~ p2(X1,X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.P6xx9rtt0W/E---3.1_8016.p',rule_238) ).
cnf(rule_295,axiom,
( q4(X1,X2)
| ~ k3(X3,X3,X1)
| ~ q2(X4,X2,X1)
| ~ m3(X4,X5,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.P6xx9rtt0W/E---3.1_8016.p',rule_295) ).
cnf(rule_085,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.P6xx9rtt0W/E---3.1_8016.p',rule_085) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/tmp/tmp.P6xx9rtt0W/E---3.1_8016.p',axiom_14) ).
cnf(rule_206,axiom,
( k3(X1,X2,X1)
| ~ p2(X2,X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.P6xx9rtt0W/E---3.1_8016.p',rule_206) ).
cnf(rule_181,axiom,
( q2(X1,X1,X1)
| ~ p1(X1,X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.P6xx9rtt0W/E---3.1_8016.p',rule_181) ).
cnf(rule_302,axiom,
( l5(X1)
| ~ q4(X2,X2)
| ~ k1(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.P6xx9rtt0W/E---3.1_8016.p',rule_302) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.P6xx9rtt0W/E---3.1_8016.p',rule_001) ).
cnf(axiom_30,axiom,
n0(e,e),
file('/export/starexec/sandbox2/tmp/tmp.P6xx9rtt0W/E---3.1_8016.p',axiom_30) ).
cnf(prove_this,negated_conjecture,
~ l5(e),
file('/export/starexec/sandbox2/tmp/tmp.P6xx9rtt0W/E---3.1_8016.p',prove_this) ).
cnf(c_0_13,axiom,
( m1(X1,X1,X1)
| ~ m0(X2,X3,X1) ),
rule_014 ).
cnf(c_0_14,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_15,axiom,
( p2(X1,X1,X1)
| ~ m1(X2,X2,X1) ),
rule_150 ).
cnf(c_0_16,plain,
m1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,axiom,
( m3(X1,X1,X1)
| ~ p2(X1,X1,X1) ),
rule_238 ).
cnf(c_0_18,plain,
p2(X1,X1,X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,axiom,
( q4(X1,X2)
| ~ k3(X3,X3,X1)
| ~ q2(X4,X2,X1)
| ~ m3(X4,X5,X4) ),
rule_295 ).
cnf(c_0_20,plain,
m3(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_21,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
rule_085 ).
cnf(c_0_22,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_23,plain,
( q4(X1,X2)
| ~ k3(X3,X3,X1)
| ~ q2(X4,X2,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,axiom,
( k3(X1,X2,X1)
| ~ p2(X2,X1,X1) ),
rule_206 ).
cnf(c_0_25,axiom,
( q2(X1,X1,X1)
| ~ p1(X1,X1,X1) ),
rule_181 ).
cnf(c_0_26,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( q4(X1,X2)
| ~ q2(X3,X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_18])]) ).
cnf(c_0_28,plain,
q2(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_29,axiom,
( l5(X1)
| ~ q4(X2,X2)
| ~ k1(X1) ),
rule_302 ).
cnf(c_0_30,plain,
q4(X1,X1),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
rule_001 ).
cnf(c_0_32,axiom,
n0(e,e),
axiom_30 ).
cnf(c_0_33,negated_conjecture,
~ l5(e),
prove_this ).
cnf(c_0_34,plain,
( l5(X1)
| ~ k1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_35,plain,
k1(e),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN129-1 : TPTP v8.1.2. Released v1.1.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n002.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Oct 2 18:40:59 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.P6xx9rtt0W/E---3.1_8016.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_3 with pid 8097 completed with status 0
% 0.18/0.55 # Result found by new_bool_3
% 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 # 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 8102 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 # 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 : 46
% 0.18/0.55 # Initial clauses : 323
% 0.18/0.55 # Removed in clause preprocessing : 7
% 0.18/0.55 # Initial clauses in saturation : 316
% 0.18/0.55 # Processed clauses : 1122
% 0.18/0.55 # ...of these trivial : 60
% 0.18/0.55 # ...subsumed : 56
% 0.18/0.55 # ...remaining for further processing : 1006
% 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 : 62
% 0.18/0.55 # Backward-rewritten : 251
% 0.18/0.55 # Generated clauses : 1507
% 0.18/0.55 # ...of the previous two non-redundant : 1014
% 0.18/0.55 # ...aggressively subsumed : 0
% 0.18/0.55 # Contextual simplify-reflections : 2
% 0.18/0.55 # Paramodulations : 1507
% 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 : 1115
% 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 : 409
% 0.18/0.55 # Positive orientable unit clauses : 193
% 0.18/0.55 # Positive unorientable unit clauses: 0
% 0.18/0.55 # Negative unit clauses : 1
% 0.18/0.55 # Non-unit-clauses : 215
% 0.18/0.55 # Current number of unprocessed clauses: 245
% 0.18/0.55 # ...number of literals in the above : 726
% 0.18/0.55 # Current number of archived formulas : 0
% 0.18/0.55 # Current number of archived clauses : 597
% 0.18/0.55 # Clause-clause subsumption calls (NU) : 43427
% 0.18/0.55 # Rec. Clause-clause subsumption calls : 30642
% 0.18/0.55 # Non-unit clause-clause subsumptions : 111
% 0.18/0.55 # Unit Clause-clause subsumption calls : 3776
% 0.18/0.55 # Rewrite failures with RHS unbound : 0
% 0.18/0.55 # BW rewrite match attempts : 514
% 0.18/0.55 # BW rewrite match successes : 169
% 0.18/0.55 # Condensation attempts : 0
% 0.18/0.55 # Condensation successes : 0
% 0.18/0.55 # Termbank termtop insertions : 25217
% 0.18/0.55
% 0.18/0.55 # -------------------------------------------------
% 0.18/0.55 # User time : 0.069 s
% 0.18/0.55 # System time : 0.008 s
% 0.18/0.55 # Total time : 0.077 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.074 s
% 0.18/0.55 # System time : 0.010 s
% 0.18/0.55 # Total time : 0.084 s
% 0.18/0.55 # Maximum resident set size: 1996 pages
% 0.18/0.55 % E---3.1 exiting
% 0.18/0.55 % E---3.1 exiting
%------------------------------------------------------------------------------