TSTP Solution File: SYN110-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN110-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:21 EDT 2024
% Result : Unsatisfiable 0.15s 0.49s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of clauses : 54 ( 28 unt; 0 nHn; 48 RR)
% Number of literals : 100 ( 0 equ; 50 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 56 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_024,axiom,
( m1(X1,a,X2)
| ~ m0(a,X3,a)
| ~ q0(X1,X2)
| ~ m1(X2,c,X2) ),
file('/export/starexec/sandbox/tmp/tmp.GxgYiMY3sK/E---3.1_18202.p',rule_024) ).
cnf(rule_020,axiom,
( m1(c,c,c)
| ~ l0(c) ),
file('/export/starexec/sandbox/tmp/tmp.GxgYiMY3sK/E---3.1_18202.p',rule_020) ).
cnf(rule_035,axiom,
( m1(X1,X2,X1)
| ~ r0(X1)
| ~ l0(X2) ),
file('/export/starexec/sandbox/tmp/tmp.GxgYiMY3sK/E---3.1_18202.p',rule_035) ).
cnf(axiom_12,axiom,
m0(a,X1,a),
file('/export/starexec/sandbox/tmp/tmp.GxgYiMY3sK/E---3.1_18202.p',axiom_12) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox/tmp/tmp.GxgYiMY3sK/E---3.1_18202.p',axiom_24) ).
cnf(axiom_20,axiom,
l0(a),
file('/export/starexec/sandbox/tmp/tmp.GxgYiMY3sK/E---3.1_18202.p',axiom_20) ).
cnf(rule_107,axiom,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
file('/export/starexec/sandbox/tmp/tmp.GxgYiMY3sK/E---3.1_18202.p',rule_107) ).
cnf(rule_127,axiom,
( k2(X1,X2)
| ~ m1(X3,X2,X1)
| ~ k1(X4)
| ~ k2(X4,X2) ),
file('/export/starexec/sandbox/tmp/tmp.GxgYiMY3sK/E---3.1_18202.p',rule_127) ).
cnf(axiom_9,axiom,
r0(b),
file('/export/starexec/sandbox/tmp/tmp.GxgYiMY3sK/E---3.1_18202.p',axiom_9) ).
cnf(rule_129,axiom,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
file('/export/starexec/sandbox/tmp/tmp.GxgYiMY3sK/E---3.1_18202.p',rule_129) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/tmp/tmp.GxgYiMY3sK/E---3.1_18202.p',axiom_19) ).
cnf(rule_001,axiom,
( k1(X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.GxgYiMY3sK/E---3.1_18202.p',rule_001) ).
cnf(axiom_33,axiom,
q0(d,c),
file('/export/starexec/sandbox/tmp/tmp.GxgYiMY3sK/E---3.1_18202.p',axiom_33) ).
cnf(prove_this,negated_conjecture,
~ k2(c,a),
file('/export/starexec/sandbox/tmp/tmp.GxgYiMY3sK/E---3.1_18202.p',prove_this) ).
cnf(axiom_37,axiom,
n0(b,a),
file('/export/starexec/sandbox/tmp/tmp.GxgYiMY3sK/E---3.1_18202.p',axiom_37) ).
cnf(axiom_15,axiom,
n0(a,b),
file('/export/starexec/sandbox/tmp/tmp.GxgYiMY3sK/E---3.1_18202.p',axiom_15) ).
cnf(c_0_16,plain,
( m1(X1,a,X2)
| ~ m0(a,X3,a)
| ~ q0(X1,X2)
| ~ m1(X2,c,X2) ),
inference(fof_simplification,[status(thm)],[rule_024]) ).
cnf(c_0_17,plain,
( m1(c,c,c)
| ~ l0(c) ),
inference(fof_simplification,[status(thm)],[rule_020]) ).
cnf(c_0_18,plain,
( m1(X1,X2,X1)
| ~ r0(X1)
| ~ l0(X2) ),
inference(fof_simplification,[status(thm)],[rule_035]) ).
cnf(c_0_19,plain,
( m1(X1,a,X2)
| ~ m0(a,X3,a)
| ~ q0(X1,X2)
| ~ m1(X2,c,X2) ),
c_0_16 ).
cnf(c_0_20,axiom,
m0(a,X1,a),
axiom_12 ).
cnf(c_0_21,plain,
( m1(c,c,c)
| ~ l0(c) ),
c_0_17 ).
cnf(c_0_22,axiom,
l0(c),
axiom_24 ).
cnf(c_0_23,plain,
( m1(X1,X2,X1)
| ~ r0(X1)
| ~ l0(X2) ),
c_0_18 ).
cnf(c_0_24,axiom,
l0(a),
axiom_20 ).
cnf(c_0_25,plain,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
inference(fof_simplification,[status(thm)],[rule_107]) ).
cnf(c_0_26,plain,
( m1(X1,a,X2)
| ~ m1(X2,c,X2)
| ~ q0(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
cnf(c_0_27,plain,
m1(c,c,c),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_28,plain,
( k2(X1,X2)
| ~ m1(X3,X2,X1)
| ~ k1(X4)
| ~ k2(X4,X2) ),
inference(fof_simplification,[status(thm)],[rule_127]) ).
cnf(c_0_29,plain,
( m1(X1,a,X1)
| ~ r0(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,axiom,
r0(b),
axiom_9 ).
cnf(c_0_31,plain,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_129]) ).
cnf(c_0_32,plain,
( q1(e,X1,X1)
| ~ m0(X1,d,X1)
| ~ m0(e,d,X1) ),
c_0_25 ).
cnf(c_0_33,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_34,plain,
( k1(X1)
| ~ n0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_35,plain,
( m1(X1,a,c)
| ~ q0(X1,c) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_36,axiom,
q0(d,c),
axiom_33 ).
cnf(c_0_37,negated_conjecture,
~ k2(c,a),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_38,plain,
( k2(X1,X2)
| ~ m1(X3,X2,X1)
| ~ k1(X4)
| ~ k2(X4,X2) ),
c_0_28 ).
cnf(c_0_39,plain,
m1(b,a,b),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_40,plain,
( k2(X1,X1)
| ~ q1(X2,X1,X1) ),
c_0_31 ).
cnf(c_0_41,plain,
q1(e,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33]),c_0_33])]) ).
cnf(c_0_42,plain,
( k1(X1)
| ~ n0(X2,X1) ),
c_0_34 ).
cnf(c_0_43,axiom,
n0(b,a),
axiom_37 ).
cnf(c_0_44,plain,
m1(d,a,c),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_45,negated_conjecture,
~ k2(c,a),
c_0_37 ).
cnf(c_0_46,plain,
( k2(b,a)
| ~ k2(X1,a)
| ~ k1(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_47,plain,
k2(X1,X1),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_48,plain,
k1(a),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,axiom,
n0(a,b),
axiom_15 ).
cnf(c_0_50,plain,
( ~ k2(X1,a)
| ~ k1(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_44]),c_0_45]) ).
cnf(c_0_51,plain,
k2(b,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]) ).
cnf(c_0_52,plain,
k1(b),
inference(spm,[status(thm)],[c_0_42,c_0_49]) ).
cnf(c_0_53,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.09 % Problem : SYN110-1 : TPTP v8.1.2. Released v1.1.0.
% 0.07/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n028.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Fri May 3 10:49:03 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 0.15/0.42 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.GxgYiMY3sK/E---3.1_18202.p
% 0.15/0.49 # Version: 3.1.0
% 0.15/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.49 # Starting sh5l with 300s (1) cores
% 0.15/0.49 # new_bool_3 with pid 18281 completed with status 0
% 0.15/0.49 # Result found by new_bool_3
% 0.15/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.49 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.15/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.49 # SAT001_MinMin_p005000_rr_RG with pid 18286 completed with status 0
% 0.15/0.49 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.49 # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.15/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.49 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.49 # Preprocessing time : 0.004 s
% 0.15/0.49 # Presaturation interreduction done
% 0.15/0.49
% 0.15/0.49 # Proof found!
% 0.15/0.49 # SZS status Unsatisfiable
% 0.15/0.49 # SZS output start CNFRefutation
% See solution above
% 0.15/0.49 # Parsed axioms : 369
% 0.15/0.49 # Removed by relevancy pruning/SinE : 41
% 0.15/0.49 # Initial clauses : 328
% 0.15/0.49 # Removed in clause preprocessing : 5
% 0.15/0.49 # Initial clauses in saturation : 323
% 0.15/0.49 # Processed clauses : 800
% 0.15/0.49 # ...of these trivial : 38
% 0.15/0.49 # ...subsumed : 24
% 0.15/0.49 # ...remaining for further processing : 738
% 0.15/0.49 # Other redundant clauses eliminated : 0
% 0.15/0.49 # Clauses deleted for lack of memory : 0
% 0.15/0.49 # Backward-subsumed : 19
% 0.15/0.49 # Backward-rewritten : 60
% 0.15/0.49 # Generated clauses : 903
% 0.15/0.49 # ...of the previous two non-redundant : 595
% 0.15/0.49 # ...aggressively subsumed : 0
% 0.15/0.49 # Contextual simplify-reflections : 1
% 0.15/0.49 # Paramodulations : 903
% 0.15/0.49 # Factorizations : 0
% 0.15/0.49 # NegExts : 0
% 0.15/0.49 # Equation resolutions : 0
% 0.15/0.49 # Disequality decompositions : 0
% 0.15/0.49 # Total rewrite steps : 615
% 0.15/0.49 # ...of those cached : 468
% 0.15/0.49 # Propositional unsat checks : 0
% 0.15/0.49 # Propositional check models : 0
% 0.15/0.49 # Propositional check unsatisfiable : 0
% 0.15/0.49 # Propositional clauses : 0
% 0.15/0.49 # Propositional clauses after purity: 0
% 0.15/0.49 # Propositional unsat core size : 0
% 0.15/0.49 # Propositional preprocessing time : 0.000
% 0.15/0.49 # Propositional encoding time : 0.000
% 0.15/0.49 # Propositional solver time : 0.000
% 0.15/0.49 # Success case prop preproc time : 0.000
% 0.15/0.49 # Success case prop encoding time : 0.000
% 0.15/0.49 # Success case prop solver time : 0.000
% 0.15/0.49 # Current number of processed clauses : 371
% 0.15/0.49 # Positive orientable unit clauses : 132
% 0.15/0.49 # Positive unorientable unit clauses: 0
% 0.15/0.49 # Negative unit clauses : 1
% 0.15/0.49 # Non-unit-clauses : 238
% 0.15/0.49 # Current number of unprocessed clauses: 394
% 0.15/0.49 # ...number of literals in the above : 1003
% 0.15/0.49 # Current number of archived formulas : 0
% 0.15/0.49 # Current number of archived clauses : 367
% 0.15/0.49 # Clause-clause subsumption calls (NU) : 33282
% 0.15/0.49 # Rec. Clause-clause subsumption calls : 23542
% 0.15/0.49 # Non-unit clause-clause subsumptions : 33
% 0.15/0.49 # Unit Clause-clause subsumption calls : 377
% 0.15/0.49 # Rewrite failures with RHS unbound : 0
% 0.15/0.49 # BW rewrite match attempts : 120
% 0.15/0.49 # BW rewrite match successes : 55
% 0.15/0.49 # Condensation attempts : 0
% 0.15/0.49 # Condensation successes : 0
% 0.15/0.49 # Termbank termtop insertions : 21912
% 0.15/0.49 # Search garbage collected termcells : 1514
% 0.15/0.49
% 0.15/0.49 # -------------------------------------------------
% 0.15/0.49 # User time : 0.051 s
% 0.15/0.49 # System time : 0.004 s
% 0.15/0.49 # Total time : 0.055 s
% 0.15/0.49 # Maximum resident set size: 2616 pages
% 0.15/0.49
% 0.15/0.49 # -------------------------------------------------
% 0.15/0.49 # User time : 0.056 s
% 0.15/0.49 # System time : 0.006 s
% 0.15/0.49 # Total time : 0.062 s
% 0.15/0.49 # Maximum resident set size: 2016 pages
% 0.15/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------