TSTP Solution File: SWC207-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC207-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:39:52 EDT 2023
% Result : Unsatisfiable 0.25s 1.10s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 28 ( 19 unt; 6 nHn; 28 RR)
% Number of literals : 43 ( 18 equ; 15 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
~ neq(sk1,nil),
file('/export/starexec/sandbox/tmp/tmp.LpUMTFabV6/E---3.1_10962.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.LpUMTFabV6/E---3.1_10962.p',co1_6) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/tmp/tmp.LpUMTFabV6/E---3.1_10962.p',co1_1) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.LpUMTFabV6/E---3.1_10962.p',clause99) ).
cnf(co1_11,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
file('/export/starexec/sandbox/tmp/tmp.LpUMTFabV6/E---3.1_10962.p',co1_11) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.LpUMTFabV6/E---3.1_10962.p',clause8) ).
cnf(co1_9,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
file('/export/starexec/sandbox/tmp/tmp.LpUMTFabV6/E---3.1_10962.p',co1_9) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.LpUMTFabV6/E---3.1_10962.p',clause100) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox/tmp/tmp.LpUMTFabV6/E---3.1_10962.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/tmp/tmp.LpUMTFabV6/E---3.1_10962.p',co1_5) ).
cnf(c_0_10,negated_conjecture,
~ neq(sk1,nil),
co1_8 ).
cnf(c_0_11,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_12,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_13,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause99 ).
cnf(c_0_14,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
co1_11 ).
cnf(c_0_15,axiom,
ssList(nil),
clause8 ).
cnf(c_0_16,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
co1_9 ).
cnf(c_0_17,negated_conjecture,
~ neq(sk3,nil),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_19,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_20,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_21,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_22,negated_conjecture,
( sk4 = nil
| sk3 != nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),c_0_16]) ).
cnf(c_0_23,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_15])]) ).
cnf(c_0_24,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_26,negated_conjecture,
~ neq(nil,nil),
inference(rw,[status(thm)],[c_0_17,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.76 % Problem : SWC207-1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.77 % Command : run_E %s %d THM
% 0.10/0.97 % Computer : n009.cluster.edu
% 0.10/0.97 % Model : x86_64 x86_64
% 0.10/0.97 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.97 % Memory : 8042.1875MB
% 0.10/0.97 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.97 % CPULimit : 2400
% 0.10/0.97 % WCLimit : 300
% 0.10/0.97 % DateTime : Tue Oct 3 01:40:53 EDT 2023
% 0.10/0.97 % CPUTime :
% 0.25/1.08 Running first-order theorem proving
% 0.25/1.08 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.LpUMTFabV6/E---3.1_10962.p
% 0.25/1.10 # Version: 3.1pre001
% 0.25/1.10 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/1.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/1.10 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/1.10 # Starting new_bool_3 with 300s (1) cores
% 0.25/1.10 # Starting new_bool_1 with 300s (1) cores
% 0.25/1.10 # Starting sh5l with 300s (1) cores
% 0.25/1.10 # new_bool_3 with pid 11041 completed with status 0
% 0.25/1.10 # Result found by new_bool_3
% 0.25/1.10 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/1.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/1.10 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/1.10 # Starting new_bool_3 with 300s (1) cores
% 0.25/1.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/1.10 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.25/1.10 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/1.10 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.25/1.10 # SAT001_MinMin_p005000_rr_RG with pid 11044 completed with status 0
% 0.25/1.10 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.25/1.10 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/1.10 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/1.10 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/1.10 # Starting new_bool_3 with 300s (1) cores
% 0.25/1.10 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/1.10 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.25/1.10 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/1.10 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.25/1.10 # Preprocessing time : 0.002 s
% 0.25/1.10 # Presaturation interreduction done
% 0.25/1.10
% 0.25/1.10 # Proof found!
% 0.25/1.10 # SZS status Unsatisfiable
% 0.25/1.10 # SZS output start CNFRefutation
% See solution above
% 0.25/1.10 # Parsed axioms : 201
% 0.25/1.10 # Removed by relevancy pruning/SinE : 145
% 0.25/1.10 # Initial clauses : 56
% 0.25/1.10 # Removed in clause preprocessing : 0
% 0.25/1.10 # Initial clauses in saturation : 56
% 0.25/1.10 # Processed clauses : 97
% 0.25/1.10 # ...of these trivial : 2
% 0.25/1.10 # ...subsumed : 3
% 0.25/1.10 # ...remaining for further processing : 92
% 0.25/1.10 # Other redundant clauses eliminated : 7
% 0.25/1.10 # Clauses deleted for lack of memory : 0
% 0.25/1.10 # Backward-subsumed : 0
% 0.25/1.10 # Backward-rewritten : 15
% 0.25/1.10 # Generated clauses : 14
% 0.25/1.10 # ...of the previous two non-redundant : 13
% 0.25/1.10 # ...aggressively subsumed : 0
% 0.25/1.10 # Contextual simplify-reflections : 1
% 0.25/1.10 # Paramodulations : 8
% 0.25/1.10 # Factorizations : 0
% 0.25/1.10 # NegExts : 0
% 0.25/1.10 # Equation resolutions : 7
% 0.25/1.10 # Total rewrite steps : 35
% 0.25/1.10 # Propositional unsat checks : 0
% 0.25/1.10 # Propositional check models : 0
% 0.25/1.10 # Propositional check unsatisfiable : 0
% 0.25/1.10 # Propositional clauses : 0
% 0.25/1.10 # Propositional clauses after purity: 0
% 0.25/1.10 # Propositional unsat core size : 0
% 0.25/1.10 # Propositional preprocessing time : 0.000
% 0.25/1.10 # Propositional encoding time : 0.000
% 0.25/1.10 # Propositional solver time : 0.000
% 0.25/1.10 # Success case prop preproc time : 0.000
% 0.25/1.10 # Success case prop encoding time : 0.000
% 0.25/1.10 # Success case prop solver time : 0.000
% 0.25/1.10 # Current number of processed clauses : 19
% 0.25/1.10 # Positive orientable unit clauses : 4
% 0.25/1.10 # Positive unorientable unit clauses: 0
% 0.25/1.10 # Negative unit clauses : 1
% 0.25/1.10 # Non-unit-clauses : 14
% 0.25/1.10 # Current number of unprocessed clauses: 24
% 0.25/1.10 # ...number of literals in the above : 110
% 0.25/1.10 # Current number of archived formulas : 0
% 0.25/1.10 # Current number of archived clauses : 67
% 0.25/1.10 # Clause-clause subsumption calls (NU) : 679
% 0.25/1.10 # Rec. Clause-clause subsumption calls : 99
% 0.25/1.10 # Non-unit clause-clause subsumptions : 4
% 0.25/1.10 # Unit Clause-clause subsumption calls : 0
% 0.25/1.10 # Rewrite failures with RHS unbound : 0
% 0.25/1.10 # BW rewrite match attempts : 2
% 0.25/1.10 # BW rewrite match successes : 2
% 0.25/1.10 # Condensation attempts : 0
% 0.25/1.10 # Condensation successes : 0
% 0.25/1.10 # Termbank termtop insertions : 3317
% 0.25/1.10
% 0.25/1.10 # -------------------------------------------------
% 0.25/1.10 # User time : 0.005 s
% 0.25/1.10 # System time : 0.003 s
% 0.25/1.10 # Total time : 0.008 s
% 0.25/1.10 # Maximum resident set size: 2056 pages
% 0.25/1.10
% 0.25/1.10 # -------------------------------------------------
% 0.25/1.10 # User time : 0.008 s
% 0.25/1.10 # System time : 0.005 s
% 0.25/1.10 # Total time : 0.013 s
% 0.25/1.10 # Maximum resident set size: 1852 pages
% 0.25/1.10 % E---3.1 exiting
% 0.25/1.10 % E---3.1 exiting
%------------------------------------------------------------------------------