TSTP Solution File: SWC323-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC323-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:42:34 EDT 2023
% Result : Unsatisfiable 0.19s 0.53s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 36 ( 15 unt; 3 nHn; 36 RR)
% Number of literals : 75 ( 29 equ; 42 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.qNPsrSI5pv/E---3.1_13254.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.qNPsrSI5pv/E---3.1_13254.p',co1_5) ).
cnf(co1_7,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != sk2
| app(X2,X1) != sk1 ),
file('/export/starexec/sandbox2/tmp/tmp.qNPsrSI5pv/E---3.1_13254.p',co1_7) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.qNPsrSI5pv/E---3.1_13254.p',co1_6) ).
cnf(clause145,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.qNPsrSI5pv/E---3.1_13254.p',clause145) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.qNPsrSI5pv/E---3.1_13254.p',clause8) ).
cnf(co1_10,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.qNPsrSI5pv/E---3.1_13254.p',co1_10) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.qNPsrSI5pv/E---3.1_13254.p',clause100) ).
cnf(co1_8,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox2/tmp/tmp.qNPsrSI5pv/E---3.1_13254.p',co1_8) ).
cnf(co1_12,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.qNPsrSI5pv/E---3.1_13254.p',co1_12) ).
cnf(co1_11,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.qNPsrSI5pv/E---3.1_13254.p',co1_11) ).
cnf(co1_9,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.qNPsrSI5pv/E---3.1_13254.p',co1_9) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.qNPsrSI5pv/E---3.1_13254.p',clause86) ).
cnf(c_0_13,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_14,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_15,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != sk2
| app(X2,X1) != sk1 ),
co1_7 ).
cnf(c_0_16,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_17,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
clause145 ).
cnf(c_0_18,axiom,
ssList(nil),
clause8 ).
cnf(c_0_19,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
co1_10 ).
cnf(c_0_20,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_21,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_22,negated_conjecture,
( app(X1,X2) != sk3
| app(X2,X1) != sk4
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_14]) ).
cnf(c_0_23,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_17])]),c_0_18])]) ).
cnf(c_0_24,negated_conjecture,
( nil = sk3
| nil != sk4 ),
co1_8 ).
cnf(c_0_25,negated_conjecture,
( sk4 = nil
| ssList(sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_18])]) ).
cnf(c_0_26,negated_conjecture,
sk4 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_23]),c_0_18])]),c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk3
| ~ neq(sk4,nil) ),
co1_12 ).
cnf(c_0_28,negated_conjecture,
ssList(sk6),
inference(sr,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk4
| ~ neq(sk4,nil) ),
co1_11 ).
cnf(c_0_30,negated_conjecture,
( ~ neq(sk4,nil)
| ~ ssList(cons(sk5,nil)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_27]),c_0_28])]),c_0_29]) ).
cnf(c_0_31,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
co1_9 ).
cnf(c_0_32,negated_conjecture,
~ ssList(cons(sk5,nil)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_20]),c_0_21]),c_0_18])]),c_0_26]) ).
cnf(c_0_33,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_34,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_20]),c_0_21]),c_0_18])]),c_0_26]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC323-1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n010.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 : Tue Oct 3 01:46:50 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.19/0.51 Running first-order model finding
% 0.19/0.51 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.qNPsrSI5pv/E---3.1_13254.p
% 0.19/0.53 # Version: 3.1pre001
% 0.19/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.53 # Starting sh5l with 300s (1) cores
% 0.19/0.53 # new_bool_3 with pid 13371 completed with status 0
% 0.19/0.53 # Result found by new_bool_3
% 0.19/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.53 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.19/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.53 # SAT001_MinMin_p005000_rr_RG with pid 13374 completed with status 0
% 0.19/0.53 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.53 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.19/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.53 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.53 # Preprocessing time : 0.003 s
% 0.19/0.53 # Presaturation interreduction done
% 0.19/0.53
% 0.19/0.53 # Proof found!
% 0.19/0.53 # SZS status Unsatisfiable
% 0.19/0.53 # SZS output start CNFRefutation
% See solution above
% 0.19/0.53 # Parsed axioms : 197
% 0.19/0.53 # Removed by relevancy pruning/SinE : 164
% 0.19/0.53 # Initial clauses : 33
% 0.19/0.53 # Removed in clause preprocessing : 0
% 0.19/0.53 # Initial clauses in saturation : 33
% 0.19/0.53 # Processed clauses : 78
% 0.19/0.53 # ...of these trivial : 2
% 0.19/0.53 # ...subsumed : 1
% 0.19/0.53 # ...remaining for further processing : 75
% 0.19/0.53 # Other redundant clauses eliminated : 10
% 0.19/0.53 # Clauses deleted for lack of memory : 0
% 0.19/0.53 # Backward-subsumed : 7
% 0.19/0.53 # Backward-rewritten : 2
% 0.19/0.53 # Generated clauses : 66
% 0.19/0.53 # ...of the previous two non-redundant : 46
% 0.19/0.53 # ...aggressively subsumed : 0
% 0.19/0.53 # Contextual simplify-reflections : 6
% 0.19/0.53 # Paramodulations : 54
% 0.19/0.53 # Factorizations : 0
% 0.19/0.53 # NegExts : 0
% 0.19/0.53 # Equation resolutions : 12
% 0.19/0.53 # Total rewrite steps : 66
% 0.19/0.53 # Propositional unsat checks : 0
% 0.19/0.53 # Propositional check models : 0
% 0.19/0.53 # Propositional check unsatisfiable : 0
% 0.19/0.53 # Propositional clauses : 0
% 0.19/0.53 # Propositional clauses after purity: 0
% 0.19/0.53 # Propositional unsat core size : 0
% 0.19/0.53 # Propositional preprocessing time : 0.000
% 0.19/0.53 # Propositional encoding time : 0.000
% 0.19/0.53 # Propositional solver time : 0.000
% 0.19/0.53 # Success case prop preproc time : 0.000
% 0.19/0.53 # Success case prop encoding time : 0.000
% 0.19/0.53 # Success case prop solver time : 0.000
% 0.19/0.53 # Current number of processed clauses : 31
% 0.19/0.53 # Positive orientable unit clauses : 8
% 0.19/0.53 # Positive unorientable unit clauses: 0
% 0.19/0.53 # Negative unit clauses : 5
% 0.19/0.53 # Non-unit-clauses : 18
% 0.19/0.53 # Current number of unprocessed clauses: 31
% 0.19/0.53 # ...number of literals in the above : 126
% 0.19/0.53 # Current number of archived formulas : 0
% 0.19/0.53 # Current number of archived clauses : 41
% 0.19/0.53 # Clause-clause subsumption calls (NU) : 179
% 0.19/0.53 # Rec. Clause-clause subsumption calls : 71
% 0.19/0.53 # Non-unit clause-clause subsumptions : 9
% 0.19/0.53 # Unit Clause-clause subsumption calls : 23
% 0.19/0.53 # Rewrite failures with RHS unbound : 0
% 0.19/0.53 # BW rewrite match attempts : 2
% 0.19/0.53 # BW rewrite match successes : 2
% 0.19/0.53 # Condensation attempts : 0
% 0.19/0.53 # Condensation successes : 0
% 0.19/0.53 # Termbank termtop insertions : 3297
% 0.19/0.53
% 0.19/0.53 # -------------------------------------------------
% 0.19/0.53 # User time : 0.008 s
% 0.19/0.53 # System time : 0.002 s
% 0.19/0.53 # Total time : 0.010 s
% 0.19/0.53 # Maximum resident set size: 1952 pages
% 0.19/0.53
% 0.19/0.53 # -------------------------------------------------
% 0.19/0.53 # User time : 0.010 s
% 0.19/0.53 # System time : 0.006 s
% 0.19/0.53 # Total time : 0.016 s
% 0.19/0.53 # Maximum resident set size: 1852 pages
% 0.19/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------