TSTP Solution File: SYN192-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN192-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:32 EDT 2023
% Result : Unsatisfiable 0.17s 0.52s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 33 ( 15 unt; 0 nHn; 22 RR)
% Number of literals : 59 ( 0 equ; 28 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 58 ( 29 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_014,axiom,
( m1(X1,X1,X1)
| ~ m0(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.0CS3DVzxci/E---3.1_11214.p',rule_014) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/tmp/tmp.0CS3DVzxci/E---3.1_11214.p',axiom_19) ).
cnf(rule_150,axiom,
( p2(X1,X1,X1)
| ~ m1(X2,X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.0CS3DVzxci/E---3.1_11214.p',rule_150) ).
cnf(rule_085,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.0CS3DVzxci/E---3.1_11214.p',rule_085) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/tmp/tmp.0CS3DVzxci/E---3.1_11214.p',axiom_14) ).
cnf(rule_240,axiom,
( n3(X1)
| ~ p2(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.0CS3DVzxci/E---3.1_11214.p',rule_240) ).
cnf(rule_181,axiom,
( q2(X1,X1,X1)
| ~ p1(X1,X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.0CS3DVzxci/E---3.1_11214.p',rule_181) ).
cnf(rule_298,axiom,
( r4(X1)
| ~ n3(X1)
| ~ q3(X2,X3)
| ~ p0(X4,X1) ),
file('/export/starexec/sandbox/tmp/tmp.0CS3DVzxci/E---3.1_11214.p',rule_298) ).
cnf(rule_255,axiom,
( q3(X1,X2)
| ~ q2(X3,X1,X2)
| ~ n0(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.0CS3DVzxci/E---3.1_11214.p',rule_255) ).
cnf(axiom_30,axiom,
n0(e,e),
file('/export/starexec/sandbox/tmp/tmp.0CS3DVzxci/E---3.1_11214.p',axiom_30) ).
cnf(prove_this,negated_conjecture,
~ r4(a),
file('/export/starexec/sandbox/tmp/tmp.0CS3DVzxci/E---3.1_11214.p',prove_this) ).
cnf(c_0_11,axiom,
( m1(X1,X1,X1)
| ~ m0(X2,X3,X1) ),
rule_014 ).
cnf(c_0_12,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_13,axiom,
( p2(X1,X1,X1)
| ~ m1(X2,X2,X1) ),
rule_150 ).
cnf(c_0_14,plain,
m1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
rule_085 ).
cnf(c_0_16,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_17,axiom,
( n3(X1)
| ~ p2(X2,X3,X1) ),
rule_240 ).
cnf(c_0_18,plain,
p2(X1,X1,X1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,axiom,
( q2(X1,X1,X1)
| ~ p1(X1,X1,X1) ),
rule_181 ).
cnf(c_0_20,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,axiom,
( r4(X1)
| ~ n3(X1)
| ~ q3(X2,X3)
| ~ p0(X4,X1) ),
rule_298 ).
cnf(c_0_22,plain,
n3(X1),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,axiom,
( q3(X1,X2)
| ~ q2(X3,X1,X2)
| ~ n0(X3,X1) ),
rule_255 ).
cnf(c_0_24,plain,
q2(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
cnf(c_0_25,plain,
( r4(X1)
| ~ q3(X2,X3)
| ~ p0(X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_26,plain,
( q3(X1,X1)
| ~ n0(X1,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( r4(X1)
| ~ p0(X2,X1)
| ~ n0(X3,X3) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,plain,
( r4(X1)
| ~ n0(X2,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_29,axiom,
n0(e,e),
axiom_30 ).
cnf(c_0_30,negated_conjecture,
~ r4(a),
prove_this ).
cnf(c_0_31,plain,
r4(X1),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.10 % Problem : SYN192-1 : TPTP v8.1.2. Released v1.1.0.
% 0.07/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n032.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon Oct 2 18:23:19 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 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.0CS3DVzxci/E---3.1_11214.p
% 0.17/0.52 # Version: 3.1pre001
% 0.17/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.52 # Starting sh5l with 300s (1) cores
% 0.17/0.52 # new_bool_1 with pid 11311 completed with status 0
% 0.17/0.52 # Result found by new_bool_1
% 0.17/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.52 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.17/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.52 # SAT001_MinMin_p005000_rr_RG with pid 11330 completed with status 0
% 0.17/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.52 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.17/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.52 # Preprocessing time : 0.004 s
% 0.17/0.52 # Presaturation interreduction done
% 0.17/0.52
% 0.17/0.52 # Proof found!
% 0.17/0.52 # SZS status Unsatisfiable
% 0.17/0.52 # SZS output start CNFRefutation
% See solution above
% 0.17/0.52 # Parsed axioms : 369
% 0.17/0.52 # Removed by relevancy pruning/SinE : 37
% 0.17/0.52 # Initial clauses : 332
% 0.17/0.52 # Removed in clause preprocessing : 7
% 0.17/0.52 # Initial clauses in saturation : 325
% 0.17/0.52 # Processed clauses : 868
% 0.17/0.52 # ...of these trivial : 33
% 0.17/0.52 # ...subsumed : 33
% 0.17/0.52 # ...remaining for further processing : 802
% 0.17/0.52 # Other redundant clauses eliminated : 0
% 0.17/0.52 # Clauses deleted for lack of memory : 0
% 0.17/0.52 # Backward-subsumed : 43
% 0.17/0.52 # Backward-rewritten : 169
% 0.17/0.52 # Generated clauses : 891
% 0.17/0.52 # ...of the previous two non-redundant : 518
% 0.17/0.52 # ...aggressively subsumed : 0
% 0.17/0.52 # Contextual simplify-reflections : 2
% 0.17/0.52 # Paramodulations : 891
% 0.17/0.52 # Factorizations : 0
% 0.17/0.52 # NegExts : 0
% 0.17/0.52 # Equation resolutions : 0
% 0.17/0.52 # Total rewrite steps : 789
% 0.17/0.52 # Propositional unsat checks : 0
% 0.17/0.52 # Propositional check models : 0
% 0.17/0.52 # Propositional check unsatisfiable : 0
% 0.17/0.52 # Propositional clauses : 0
% 0.17/0.52 # Propositional clauses after purity: 0
% 0.17/0.52 # Propositional unsat core size : 0
% 0.17/0.52 # Propositional preprocessing time : 0.000
% 0.17/0.52 # Propositional encoding time : 0.000
% 0.17/0.52 # Propositional solver time : 0.000
% 0.17/0.52 # Success case prop preproc time : 0.000
% 0.17/0.52 # Success case prop encoding time : 0.000
% 0.17/0.52 # Success case prop solver time : 0.000
% 0.17/0.52 # Current number of processed clauses : 300
% 0.17/0.52 # Positive orientable unit clauses : 117
% 0.17/0.52 # Positive unorientable unit clauses: 0
% 0.17/0.52 # Negative unit clauses : 1
% 0.17/0.52 # Non-unit-clauses : 182
% 0.17/0.52 # Current number of unprocessed clauses: 230
% 0.17/0.52 # ...number of literals in the above : 604
% 0.17/0.52 # Current number of archived formulas : 0
% 0.17/0.52 # Current number of archived clauses : 502
% 0.17/0.52 # Clause-clause subsumption calls (NU) : 34072
% 0.17/0.52 # Rec. Clause-clause subsumption calls : 23860
% 0.17/0.52 # Non-unit clause-clause subsumptions : 67
% 0.17/0.52 # Unit Clause-clause subsumption calls : 2098
% 0.17/0.52 # Rewrite failures with RHS unbound : 0
% 0.17/0.52 # BW rewrite match attempts : 243
% 0.17/0.52 # BW rewrite match successes : 116
% 0.17/0.52 # Condensation attempts : 0
% 0.17/0.52 # Condensation successes : 0
% 0.17/0.52 # Termbank termtop insertions : 18822
% 0.17/0.52
% 0.17/0.52 # -------------------------------------------------
% 0.17/0.52 # User time : 0.052 s
% 0.17/0.52 # System time : 0.006 s
% 0.17/0.52 # Total time : 0.058 s
% 0.17/0.52 # Maximum resident set size: 2480 pages
% 0.17/0.52
% 0.17/0.52 # -------------------------------------------------
% 0.17/0.52 # User time : 0.056 s
% 0.17/0.52 # System time : 0.009 s
% 0.17/0.52 # Total time : 0.066 s
% 0.17/0.52 # Maximum resident set size: 2000 pages
% 0.17/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------