TSTP Solution File: SYN121-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SYN121-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:20 EDT 2023
% Result : Unsatisfiable 0.20s 0.59s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 27 ( 14 unt; 0 nHn; 15 RR)
% Number of literals : 52 ( 0 equ; 27 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 42 ( 21 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_126,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.J4D8lGwIm0/E---3.1_29469.p',rule_126) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox2/tmp/tmp.J4D8lGwIm0/E---3.1_29469.p',axiom_17) ).
cnf(rule_125,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.J4D8lGwIm0/E---3.1_29469.p',rule_125) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/tmp/tmp.J4D8lGwIm0/E---3.1_29469.p',axiom_14) ).
cnf(rule_133,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.J4D8lGwIm0/E---3.1_29469.p',rule_133) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox2/tmp/tmp.J4D8lGwIm0/E---3.1_29469.p',axiom_19) ).
cnf(rule_131,axiom,
( l2(X1,X2)
| ~ s1(X1)
| ~ n0(e,X2)
| ~ l2(X2,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.J4D8lGwIm0/E---3.1_29469.p',rule_131) ).
cnf(prove_this,negated_conjecture,
~ l2(a,b),
file('/export/starexec/sandbox2/tmp/tmp.J4D8lGwIm0/E---3.1_29469.p',prove_this) ).
cnf(axiom_11,axiom,
n0(e,b),
file('/export/starexec/sandbox2/tmp/tmp.J4D8lGwIm0/E---3.1_29469.p',axiom_11) ).
cnf(c_0_9,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
rule_126 ).
cnf(c_0_10,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_11,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
rule_125 ).
cnf(c_0_12,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_13,plain,
( s1(X1)
| ~ s1(X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
s1(b),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
rule_133 ).
cnf(c_0_16,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ m0(X3,X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
cnf(c_0_18,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_19,axiom,
( l2(X1,X2)
| ~ s1(X1)
| ~ n0(e,X2)
| ~ l2(X2,X2) ),
rule_131 ).
cnf(c_0_20,plain,
( l2(X1,X1)
| ~ p0(X2,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( l2(X1,X2)
| ~ l2(X2,X2)
| ~ n0(e,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_16])]) ).
cnf(c_0_22,plain,
l2(X1,X1),
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_23,negated_conjecture,
~ l2(a,b),
prove_this ).
cnf(c_0_24,plain,
( l2(X1,X2)
| ~ n0(e,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_25,axiom,
n0(e,b),
axiom_11 ).
cnf(c_0_26,negated_conjecture,
$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.13/0.13 % Problem : SYN121-1 : TPTP v8.1.2. Released v1.1.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 18:43:16 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.50 Running first-order model finding
% 0.20/0.50 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.J4D8lGwIm0/E---3.1_29469.p
% 0.20/0.59 # Version: 3.1pre001
% 0.20/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.59 # Starting sh5l with 300s (1) cores
% 0.20/0.59 # new_bool_3 with pid 29554 completed with status 0
% 0.20/0.59 # Result found by new_bool_3
% 0.20/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.59 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.20/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.59 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.59 # SAT001_MinMin_p005000_rr_RG with pid 29561 completed with status 0
% 0.20/0.59 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.59 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.59 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.20/0.59 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.59 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.59 # Preprocessing time : 0.005 s
% 0.20/0.59 # Presaturation interreduction done
% 0.20/0.59
% 0.20/0.59 # Proof found!
% 0.20/0.59 # SZS status Unsatisfiable
% 0.20/0.59 # SZS output start CNFRefutation
% See solution above
% 0.20/0.59 # Parsed axioms : 369
% 0.20/0.59 # Removed by relevancy pruning/SinE : 55
% 0.20/0.59 # Initial clauses : 314
% 0.20/0.59 # Removed in clause preprocessing : 5
% 0.20/0.59 # Initial clauses in saturation : 309
% 0.20/0.59 # Processed clauses : 856
% 0.20/0.59 # ...of these trivial : 44
% 0.20/0.59 # ...subsumed : 35
% 0.20/0.59 # ...remaining for further processing : 777
% 0.20/0.59 # Other redundant clauses eliminated : 0
% 0.20/0.59 # Clauses deleted for lack of memory : 0
% 0.20/0.59 # Backward-subsumed : 32
% 0.20/0.59 # Backward-rewritten : 194
% 0.20/0.59 # Generated clauses : 1110
% 0.20/0.59 # ...of the previous two non-redundant : 750
% 0.20/0.59 # ...aggressively subsumed : 0
% 0.20/0.59 # Contextual simplify-reflections : 1
% 0.20/0.59 # Paramodulations : 1110
% 0.20/0.59 # Factorizations : 0
% 0.20/0.59 # NegExts : 0
% 0.20/0.59 # Equation resolutions : 0
% 0.20/0.59 # Total rewrite steps : 879
% 0.20/0.59 # Propositional unsat checks : 0
% 0.20/0.59 # Propositional check models : 0
% 0.20/0.59 # Propositional check unsatisfiable : 0
% 0.20/0.59 # Propositional clauses : 0
% 0.20/0.59 # Propositional clauses after purity: 0
% 0.20/0.59 # Propositional unsat core size : 0
% 0.20/0.59 # Propositional preprocessing time : 0.000
% 0.20/0.59 # Propositional encoding time : 0.000
% 0.20/0.59 # Propositional solver time : 0.000
% 0.20/0.59 # Success case prop preproc time : 0.000
% 0.20/0.59 # Success case prop encoding time : 0.000
% 0.20/0.59 # Success case prop solver time : 0.000
% 0.20/0.59 # Current number of processed clauses : 277
% 0.20/0.59 # Positive orientable unit clauses : 134
% 0.20/0.59 # Positive unorientable unit clauses: 0
% 0.20/0.59 # Negative unit clauses : 1
% 0.20/0.59 # Non-unit-clauses : 142
% 0.20/0.59 # Current number of unprocessed clauses: 398
% 0.20/0.59 # ...number of literals in the above : 1015
% 0.20/0.59 # Current number of archived formulas : 0
% 0.20/0.59 # Current number of archived clauses : 500
% 0.20/0.59 # Clause-clause subsumption calls (NU) : 32149
% 0.20/0.59 # Rec. Clause-clause subsumption calls : 22527
% 0.20/0.59 # Non-unit clause-clause subsumptions : 56
% 0.20/0.59 # Unit Clause-clause subsumption calls : 1822
% 0.20/0.59 # Rewrite failures with RHS unbound : 0
% 0.20/0.59 # BW rewrite match attempts : 403
% 0.20/0.59 # BW rewrite match successes : 122
% 0.20/0.59 # Condensation attempts : 0
% 0.20/0.59 # Condensation successes : 0
% 0.20/0.59 # Termbank termtop insertions : 20671
% 0.20/0.59
% 0.20/0.59 # -------------------------------------------------
% 0.20/0.59 # User time : 0.069 s
% 0.20/0.59 # System time : 0.004 s
% 0.20/0.59 # Total time : 0.074 s
% 0.20/0.59 # Maximum resident set size: 2452 pages
% 0.20/0.59
% 0.20/0.59 # -------------------------------------------------
% 0.20/0.59 # User time : 0.076 s
% 0.20/0.59 # System time : 0.006 s
% 0.20/0.59 # Total time : 0.082 s
% 0.20/0.59 # Maximum resident set size: 2000 pages
% 0.20/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------