TSTP Solution File: SYN195-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN195-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 10:19:36 EDT 2024
% Result : Unsatisfiable 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 49 ( 19 unt; 0 nHn; 49 RR)
% Number of literals : 96 ( 0 equ; 50 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 : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 62 ( 24 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_002,axiom,
( l1(X1,X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.O8XaDF3PaT/E---3.1_16658.p',rule_002) ).
cnf(rule_186,axiom,
( q2(X1,X1,X2)
| ~ l1(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.O8XaDF3PaT/E---3.1_16658.p',rule_186) ).
cnf(axiom_34,axiom,
n0(c,d),
file('/export/starexec/sandbox/tmp/tmp.O8XaDF3PaT/E---3.1_16658.p',axiom_34) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.O8XaDF3PaT/E---3.1_16658.p',rule_001) ).
cnf(rule_250,axiom,
( p3(X1,X1,X1)
| ~ k1(X1)
| ~ q2(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.O8XaDF3PaT/E---3.1_16658.p',rule_250) ).
cnf(rule_117,axiom,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
file('/export/starexec/sandbox/tmp/tmp.O8XaDF3PaT/E---3.1_16658.p',rule_117) ).
cnf(rule_327,axiom,
( r5(X1,X2)
| ~ s4(X1)
| ~ k0(b)
| ~ n3(X2) ),
file('/export/starexec/sandbox/tmp/tmp.O8XaDF3PaT/E---3.1_16658.p',rule_327) ).
cnf(rule_299,axiom,
( s4(X1)
| ~ p3(X2,X3,X4)
| ~ l1(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.O8XaDF3PaT/E---3.1_16658.p',rule_299) ).
cnf(rule_154,axiom,
( p2(X1,X1,X1)
| ~ q1(X1,X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.O8XaDF3PaT/E---3.1_16658.p',rule_154) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox/tmp/tmp.O8XaDF3PaT/E---3.1_16658.p',axiom_1) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox/tmp/tmp.O8XaDF3PaT/E---3.1_16658.p',axiom_28) ).
cnf(axiom_32,axiom,
k0(b),
file('/export/starexec/sandbox/tmp/tmp.O8XaDF3PaT/E---3.1_16658.p',axiom_32) ).
cnf(rule_240,axiom,
( n3(X1)
| ~ p2(X2,X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.O8XaDF3PaT/E---3.1_16658.p',rule_240) ).
cnf(prove_this,negated_conjecture,
~ r5(d,d),
file('/export/starexec/sandbox/tmp/tmp.O8XaDF3PaT/E---3.1_16658.p',prove_this) ).
cnf(c_0_14,plain,
( l1(X1,X1)
| ~ n0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_002]) ).
cnf(c_0_15,plain,
( q2(X1,X1,X2)
| ~ l1(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_186]) ).
cnf(c_0_16,plain,
( l1(X1,X1)
| ~ n0(X2,X1) ),
c_0_14 ).
cnf(c_0_17,axiom,
n0(c,d),
axiom_34 ).
cnf(c_0_18,plain,
( k1(X1)
| ~ n0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_19,plain,
( p3(X1,X1,X1)
| ~ k1(X1)
| ~ q2(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[rule_250]) ).
cnf(c_0_20,plain,
( q2(X1,X1,X2)
| ~ l1(X2,X1) ),
c_0_15 ).
cnf(c_0_21,plain,
l1(d,d),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( k1(X1)
| ~ n0(X2,X1) ),
c_0_18 ).
cnf(c_0_23,plain,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
inference(fof_simplification,[status(thm)],[rule_117]) ).
cnf(c_0_24,plain,
( r5(X1,X2)
| ~ s4(X1)
| ~ k0(b)
| ~ n3(X2) ),
inference(fof_simplification,[status(thm)],[rule_327]) ).
cnf(c_0_25,plain,
( s4(X1)
| ~ p3(X2,X3,X4)
| ~ l1(X1,X3) ),
inference(fof_simplification,[status(thm)],[rule_299]) ).
cnf(c_0_26,plain,
( p3(X1,X1,X1)
| ~ k1(X1)
| ~ q2(X2,X3,X1) ),
c_0_19 ).
cnf(c_0_27,plain,
q2(d,d,d),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
k1(d),
inference(spm,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_29,plain,
( p2(X1,X1,X1)
| ~ q1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_154]) ).
cnf(c_0_30,plain,
( q1(d,d,d)
| ~ k0(e)
| ~ s0(d) ),
c_0_23 ).
cnf(c_0_31,axiom,
s0(d),
axiom_1 ).
cnf(c_0_32,axiom,
k0(e),
axiom_28 ).
cnf(c_0_33,plain,
( r5(X1,X2)
| ~ s4(X1)
| ~ k0(b)
| ~ n3(X2) ),
c_0_24 ).
cnf(c_0_34,axiom,
k0(b),
axiom_32 ).
cnf(c_0_35,plain,
( s4(X1)
| ~ p3(X2,X3,X4)
| ~ l1(X1,X3) ),
c_0_25 ).
cnf(c_0_36,plain,
p3(d,d,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_37,plain,
( n3(X1)
| ~ p2(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[rule_240]) ).
cnf(c_0_38,plain,
( p2(X1,X1,X1)
| ~ q1(X1,X1,X1) ),
c_0_29 ).
cnf(c_0_39,plain,
q1(d,d,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_40,negated_conjecture,
~ r5(d,d),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_41,plain,
( r5(X1,X2)
| ~ s4(X1)
| ~ n3(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_42,plain,
( s4(X1)
| ~ l1(X1,d) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,plain,
( n3(X1)
| ~ p2(X2,X3,X1) ),
c_0_37 ).
cnf(c_0_44,plain,
p2(d,d,d),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,negated_conjecture,
~ r5(d,d),
c_0_40 ).
cnf(c_0_46,plain,
( r5(X1,X2)
| ~ n3(X2)
| ~ l1(X1,d) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
n3(d),
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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN195-1 : TPTP v8.1.2. Released v1.1.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n014.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 10:36:01 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/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.O8XaDF3PaT/E---3.1_16658.p
% 0.21/0.54 # Version: 3.1.0
% 0.21/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # Starting sh5l with 300s (1) cores
% 0.21/0.54 # new_bool_3 with pid 16743 completed with status 0
% 0.21/0.54 # Result found by new_bool_3
% 0.21/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.21/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.54 # SAT001_MinMin_p005000_rr_RG with pid 16751 completed with status 0
% 0.21/0.54 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.54 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.54 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.21/0.54 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.54 # Preprocessing time : 0.003 s
% 0.21/0.54 # Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Unsatisfiable
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 369
% 0.21/0.54 # Removed by relevancy pruning/SinE : 61
% 0.21/0.54 # Initial clauses : 308
% 0.21/0.54 # Removed in clause preprocessing : 6
% 0.21/0.54 # Initial clauses in saturation : 302
% 0.21/0.54 # Processed clauses : 585
% 0.21/0.54 # ...of these trivial : 27
% 0.21/0.54 # ...subsumed : 22
% 0.21/0.54 # ...remaining for further processing : 536
% 0.21/0.54 # Other redundant clauses eliminated : 0
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 6
% 0.21/0.54 # Backward-rewritten : 60
% 0.21/0.54 # Generated clauses : 286
% 0.21/0.54 # ...of the previous two non-redundant : 189
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 2
% 0.21/0.54 # Paramodulations : 286
% 0.21/0.54 # Factorizations : 0
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 0
% 0.21/0.54 # Disequality decompositions : 0
% 0.21/0.54 # Total rewrite steps : 274
% 0.21/0.54 # ...of those cached : 164
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 200
% 0.21/0.54 # Positive orientable unit clauses : 88
% 0.21/0.54 # Positive unorientable unit clauses: 0
% 0.21/0.54 # Negative unit clauses : 2
% 0.21/0.54 # Non-unit-clauses : 110
% 0.21/0.54 # Current number of unprocessed clauses: 167
% 0.21/0.54 # ...number of literals in the above : 474
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 336
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 20317
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 14778
% 0.21/0.54 # Non-unit clause-clause subsumptions : 29
% 0.21/0.54 # Unit Clause-clause subsumption calls : 473
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 94
% 0.21/0.54 # BW rewrite match successes : 44
% 0.21/0.54 # Condensation attempts : 0
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 14021
% 0.21/0.54 # Search garbage collected termcells : 1529
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.027 s
% 0.21/0.54 # System time : 0.003 s
% 0.21/0.54 # Total time : 0.030 s
% 0.21/0.54 # Maximum resident set size: 2572 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.034 s
% 0.21/0.54 # System time : 0.005 s
% 0.21/0.54 # Total time : 0.039 s
% 0.21/0.54 # Maximum resident set size: 2012 pages
% 0.21/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------