TSTP Solution File: SWC106-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC106-1 : TPTP v8.1.2. Released v2.4.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:41:31 EDT 2023
% Result : Unsatisfiable 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of clauses : 40 ( 18 unt; 3 nHn; 40 RR)
% Number of literals : 79 ( 17 equ; 43 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.x4OtbYUoCA/E---3.1_10117.p',co1_7) ).
cnf(co1_16,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.x4OtbYUoCA/E---3.1_10117.p',co1_16) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.x4OtbYUoCA/E---3.1_10117.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.x4OtbYUoCA/E---3.1_10117.p',co1_5) ).
cnf(co1_15,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.x4OtbYUoCA/E---3.1_10117.p',co1_15) ).
cnf(clause143,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.x4OtbYUoCA/E---3.1_10117.p',clause143) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.x4OtbYUoCA/E---3.1_10117.p',clause85) ).
cnf(co1_17,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.x4OtbYUoCA/E---3.1_10117.p',co1_17) ).
cnf(co1_18,negated_conjecture,
( ~ neq(sk1,nil)
| ~ rearsegP(sk2,sk1)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.x4OtbYUoCA/E---3.1_10117.p',co1_18) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.x4OtbYUoCA/E---3.1_10117.p',co1_1) ).
cnf(co1_14,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.x4OtbYUoCA/E---3.1_10117.p',co1_14) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.x4OtbYUoCA/E---3.1_10117.p',clause99) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.x4OtbYUoCA/E---3.1_10117.p',clause8) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.x4OtbYUoCA/E---3.1_10117.p',clause100) ).
cnf(c_0_14,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_15,negated_conjecture,
( cons(sk5,nil) = sk3
| ~ neq(sk4,nil) ),
co1_16 ).
cnf(c_0_16,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_17,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_18,negated_conjecture,
neq(sk2,nil),
c_0_14 ).
cnf(c_0_19,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
co1_15 ).
cnf(c_0_20,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause143 ).
cnf(c_0_21,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_22,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk4
| ~ neq(sk4,nil) ),
co1_17 ).
cnf(c_0_23,negated_conjecture,
cons(sk5,nil) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).
cnf(c_0_24,negated_conjecture,
( ssList(sk6)
| ~ neq(sk2,nil) ),
inference(rw,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_25,negated_conjecture,
( ~ neq(sk1,nil)
| ~ rearsegP(sk2,sk1)
| ~ neq(sk4,nil) ),
co1_18 ).
cnf(c_0_26,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_20]),c_0_21]) ).
cnf(c_0_27,negated_conjecture,
app(sk6,sk1) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_17]),c_0_17]),c_0_18])]) ).
cnf(c_0_28,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_29,negated_conjecture,
ssList(sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_18])]) ).
cnf(c_0_30,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
co1_14 ).
cnf(c_0_31,negated_conjecture,
( ~ neq(sk1,nil)
| ~ rearsegP(sk2,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_17]),c_0_18])]) ).
cnf(c_0_32,negated_conjecture,
rearsegP(sk2,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]) ).
cnf(c_0_33,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause99 ).
cnf(c_0_34,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_17]),c_0_18])]) ).
cnf(c_0_35,axiom,
ssList(nil),
clause8 ).
cnf(c_0_36,negated_conjecture,
~ neq(sk1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_37,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_38,negated_conjecture,
sk1 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_23]),c_0_34]),c_0_35])]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_28]),c_0_35])]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : SWC106-1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n014.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 01:38:04 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order model finding
% 0.17/0.44 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.x4OtbYUoCA/E---3.1_10117.p
% 0.17/0.47 # Version: 3.1pre001
% 0.17/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47 # Starting sh5l with 300s (1) cores
% 0.17/0.47 # new_bool_3 with pid 10196 completed with status 0
% 0.17/0.47 # Result found by new_bool_3
% 0.17/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.17/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.47 # SAT001_MinMin_p005000_rr_RG with pid 10199 completed with status 0
% 0.17/0.47 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.17/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.47 # Preprocessing time : 0.004 s
% 0.17/0.47 # Presaturation interreduction done
% 0.17/0.47
% 0.17/0.47 # Proof found!
% 0.17/0.47 # SZS status Unsatisfiable
% 0.17/0.47 # SZS output start CNFRefutation
% See solution above
% 0.17/0.47 # Parsed axioms : 203
% 0.17/0.47 # Removed by relevancy pruning/SinE : 156
% 0.17/0.47 # Initial clauses : 47
% 0.17/0.47 # Removed in clause preprocessing : 0
% 0.17/0.47 # Initial clauses in saturation : 47
% 0.17/0.47 # Processed clauses : 107
% 0.17/0.47 # ...of these trivial : 8
% 0.17/0.47 # ...subsumed : 6
% 0.17/0.47 # ...remaining for further processing : 93
% 0.17/0.47 # Other redundant clauses eliminated : 10
% 0.17/0.47 # Clauses deleted for lack of memory : 0
% 0.17/0.47 # Backward-subsumed : 0
% 0.17/0.47 # Backward-rewritten : 2
% 0.17/0.47 # Generated clauses : 93
% 0.17/0.47 # ...of the previous two non-redundant : 73
% 0.17/0.47 # ...aggressively subsumed : 0
% 0.17/0.47 # Contextual simplify-reflections : 2
% 0.17/0.47 # Paramodulations : 80
% 0.17/0.47 # Factorizations : 0
% 0.17/0.47 # NegExts : 0
% 0.17/0.47 # Equation resolutions : 14
% 0.17/0.47 # Total rewrite steps : 116
% 0.17/0.47 # Propositional unsat checks : 0
% 0.17/0.47 # Propositional check models : 0
% 0.17/0.47 # Propositional check unsatisfiable : 0
% 0.17/0.47 # Propositional clauses : 0
% 0.17/0.47 # Propositional clauses after purity: 0
% 0.17/0.47 # Propositional unsat core size : 0
% 0.17/0.47 # Propositional preprocessing time : 0.000
% 0.17/0.47 # Propositional encoding time : 0.000
% 0.17/0.47 # Propositional solver time : 0.000
% 0.17/0.47 # Success case prop preproc time : 0.000
% 0.17/0.47 # Success case prop encoding time : 0.000
% 0.17/0.47 # Success case prop solver time : 0.000
% 0.17/0.47 # Current number of processed clauses : 47
% 0.17/0.47 # Positive orientable unit clauses : 13
% 0.17/0.47 # Positive unorientable unit clauses: 0
% 0.17/0.47 # Negative unit clauses : 4
% 0.17/0.47 # Non-unit-clauses : 30
% 0.17/0.47 # Current number of unprocessed clauses: 52
% 0.17/0.47 # ...number of literals in the above : 226
% 0.17/0.47 # Current number of archived formulas : 0
% 0.17/0.47 # Current number of archived clauses : 41
% 0.17/0.47 # Clause-clause subsumption calls (NU) : 282
% 0.17/0.47 # Rec. Clause-clause subsumption calls : 115
% 0.17/0.47 # Non-unit clause-clause subsumptions : 5
% 0.17/0.47 # Unit Clause-clause subsumption calls : 29
% 0.17/0.47 # Rewrite failures with RHS unbound : 0
% 0.17/0.47 # BW rewrite match attempts : 2
% 0.17/0.47 # BW rewrite match successes : 2
% 0.17/0.47 # Condensation attempts : 0
% 0.17/0.47 # Condensation successes : 0
% 0.17/0.47 # Termbank termtop insertions : 4165
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.005 s
% 0.17/0.47 # System time : 0.007 s
% 0.17/0.47 # Total time : 0.011 s
% 0.17/0.47 # Maximum resident set size: 1944 pages
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.007 s
% 0.17/0.47 # System time : 0.010 s
% 0.17/0.47 # Total time : 0.017 s
% 0.17/0.47 # Maximum resident set size: 1852 pages
% 0.17/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------