TSTP Solution File: SWC182-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC182-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:55 EDT 2023
% Result : Timeout 0.30s 300.09s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of clauses : 38 ( 20 unt; 3 nHn; 38 RR)
% Number of literals : 68 ( 23 equ; 29 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.XLblZVeNfN/E---3.1_23565.p',co1_7) ).
cnf(co1_5,negated_conjecture,
nil = sk3,
file('/export/starexec/sandbox/tmp/tmp.XLblZVeNfN/E---3.1_23565.p',co1_5) ).
cnf(co1_11,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
file('/export/starexec/sandbox/tmp/tmp.XLblZVeNfN/E---3.1_23565.p',co1_11) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.XLblZVeNfN/E---3.1_23565.p',clause119) ).
cnf(co1_10,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/tmp/tmp.XLblZVeNfN/E---3.1_23565.p',co1_10) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.XLblZVeNfN/E---3.1_23565.p',clause118) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.XLblZVeNfN/E---3.1_23565.p',clause85) ).
cnf(co1_9,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/tmp/tmp.XLblZVeNfN/E---3.1_23565.p',co1_9) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.XLblZVeNfN/E---3.1_23565.p',clause86) ).
cnf(co1_8,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/tmp/tmp.XLblZVeNfN/E---3.1_23565.p',co1_8) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.XLblZVeNfN/E---3.1_23565.p',clause8) ).
cnf(co1_12,negated_conjecture,
( memberP(sk6,sk5)
| memberP(sk7,sk5) ),
file('/export/starexec/sandbox/tmp/tmp.XLblZVeNfN/E---3.1_23565.p',co1_12) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.XLblZVeNfN/E---3.1_23565.p',clause71) ).
cnf(c_0_13,negated_conjecture,
sk1 = sk3,
co1_7 ).
cnf(c_0_14,negated_conjecture,
nil = sk3,
co1_5 ).
cnf(c_0_15,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
co1_11 ).
cnf(c_0_16,negated_conjecture,
sk1 = nil,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause119 ).
cnf(c_0_18,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = nil,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
ssList(sk7),
co1_10 ).
cnf(c_0_20,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause118 ).
cnf(c_0_21,negated_conjecture,
( sk7 = nil
| ~ ssList(app(sk6,cons(sk5,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_23,negated_conjecture,
ssList(sk6),
co1_9 ).
cnf(c_0_24,negated_conjecture,
( app(sk6,cons(sk5,nil)) = nil
| ~ ssList(app(sk6,cons(sk5,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_18]),c_0_19])]) ).
cnf(c_0_25,negated_conjecture,
( sk7 = nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_26,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_27,negated_conjecture,
ssItem(sk5),
co1_8 ).
cnf(c_0_28,axiom,
ssList(nil),
clause8 ).
cnf(c_0_29,negated_conjecture,
( app(sk6,cons(sk5,nil)) = nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_22]),c_0_23])]) ).
cnf(c_0_30,negated_conjecture,
( memberP(sk6,sk5)
| memberP(sk7,sk5) ),
co1_12 ).
cnf(c_0_31,negated_conjecture,
sk7 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_32,negated_conjecture,
( sk6 = nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_29]),c_0_23])]) ).
cnf(c_0_33,negated_conjecture,
( memberP(nil,sk5)
| memberP(sk6,sk5) ),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
sk6 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_35,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_36,negated_conjecture,
memberP(nil,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SWC182-1 : TPTP v8.1.2. Released v2.4.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.09/0.31 % Computer : n006.cluster.edu
% 0.09/0.31 % Model : x86_64 x86_64
% 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31 % Memory : 8042.1875MB
% 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31 % CPULimit : 2400
% 0.09/0.31 % WCLimit : 300
% 0.09/0.31 % DateTime : Tue Oct 3 01:45:41 EDT 2023
% 0.09/0.31 % 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.XLblZVeNfN/E---3.1_23565.p
% 0.30/300.09 # Version: 3.1pre001
% 0.30/300.09 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.30/300.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/300.09 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.30/300.09 # Starting new_bool_3 with 300s (1) cores
% 0.30/300.09 # Starting new_bool_1 with 300s (1) cores
% 0.30/300.09 # Starting sh5l with 300s (1) cores
% 0.30/300.09 # new_bool_3 with pid 23643 completed with status 0
% 0.30/300.09 # Result found by new_bool_3
% 0.30/300.09 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.30/300.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/300.09 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.30/300.09 # Starting new_bool_3 with 300s (1) cores
% 0.30/300.09 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.30/300.09 # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.30/300.09 # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.30/300.09 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.30/300.09 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.30/300.09 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 23646 completed with status 0
% 0.30/300.09 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.30/300.09 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.30/300.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/300.09 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.30/300.09 # Starting new_bool_3 with 300s (1) cores
% 0.30/300.09 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.30/300.09 # Search class: FGHSF-FFMM22-MFFFFFNN
% 0.30/300.09 # partial match(1): FGHSF-FFMM21-MFFFFFNN
% 0.30/300.09 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.30/300.09 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.30/300.09 # Preprocessing time : 0.002 s
% 0.30/300.09 # Presaturation interreduction done
% 0.30/300.09
% 0.30/300.09 # Proof found!
% 0.30/300.09 # SZS status Unsatisfiable
% 0.30/300.09 # SZS output start CNFRefutation
% See solution above
% 0.30/300.09 # Parsed axioms : 197
% 0.30/300.09 # Removed by relevancy pruning/SinE : 160
% 0.30/300.09 # Initial clauses : 37
% 0.30/300.09 # Removed in clause preprocessing : 0
% 0.30/300.09 # Initial clauses in saturation : 37
% 0.30/300.09 # Processed clauses : 81
% 0.30/300.09 # ...of these trivial : 3
% 0.30/300.09 # ...subsumed : 0
% 0.30/300.09 # ...remaining for further processing : 78
% 0.30/300.09 # Other redundant clauses eliminated : 8
% 0.30/300.09 # Clauses deleted for lack of memory : 0
% 0.30/300.09 # Backward-subsumed : 0
% 0.30/300.09 # Backward-rewritten : 10
% 0.30/300.09 # Generated clauses : 92
% 0.30/300.09 # ...of the previous two non-redundant : 73
% 0.30/300.09 # ...aggressively subsumed : 0
% 0.30/300.09 # Contextual simplify-reflections : 0
% 0.30/300.09 # Paramodulations : 81
% 0.30/300.09 # Factorizations : 0
% 0.30/300.09 # NegExts : 0
% 0.30/300.09 # Equation resolutions : 12
% 0.30/300.09 # Total rewrite steps : 86
% 0.30/300.09 # Propositional unsat checks : 0
% 0.30/300.09 # Propositional check models : 0
% 0.30/300.09 # Propositional check unsatisfiable : 0
% 0.30/300.09 # Propositional clauses : 0
% 0.30/300.09 # Propositional clauses after purity: 0
% 0.30/300.09 # Propositional unsat core size : 0
% 0.30/300.09 # Propositional preprocessing time : 0.000
% 0.30/300.09 # Propositional encoding time : 0.000
% 0.30/300.09 # Propositional solver time : 0.000
% 0.30/300.09 # Success case prop preproc time : 0.000
% 0.30/300.09 # Success case prop encoding time : 0.000
% 0.30/300.09 # Success case prop solver time : 0.000
% 0.30/300.09 # Current number of processed clauses : 31
% 0.30/300.09 # Positive orientable unit clauses : 11
% 0.30/300.09 # Positive unorientable unit clauses: 0
% 0.30/300.09 # Negative unit clauses : 0
% 0.30/300.09 # Non-unit-clauses : 20
% 0.30/300.09 # Current number of unprocessed clauses: 63
% 0.30/300.09 # ...number of literals in the above : 270
% 0.30/300.09 # Current number of archived formulas : 0
% 0.30/300.09 # Current number of archived clauses : 44
% 0.30/300.09 # Clause-clause subsumption calls (NU) : 161
% 0.30/300.09 # Rec. Clause-clause subsumption calls : 50
% 0.30/300.09 # Non-unit clause-clause subsumptions : 0
% 0.30/300.09 # Unit Clause-clause subsumption calls : 6
% 0.30/300.09 # Rewrite failures with RHS unbound : 0
% 0.30/300.09 # BW rewrite match attempts : 2
% 0.30/300.09 # BW rewrite match successes : 2
% 0.30/300.09 # Condensation attempts : 0
% 0.30/300.09 # Condensation successes : 0
% 0.30/300.09 # Termbank termtop insertions : 4054
% 0.30/300.09
% 0.30/300.09 # -------------------------------------------------
% 0.30/300.09 # User time : 0.008 s
% 0.30/300.09 # System time : 0.001 s
% 0.30/300.09 # Total time : 0.008 s
% 0.30/300.09 # Maximum resident set size: 2008 pages
% 0.30/300.09
% 0.30/300.09 # -------------------------------------------------
% 0.30/300.09 # User time : 0.011 s
% 0.30/300.09 # System time : 0.003 s
% 0.30/300.09 # Total time : 0.014 s
% 0.30/300.09 # Maximum resident set size: 1848 pages
% 0.30/300.09 % E---3.1 exiting
%------------------------------------------------------------------------------