TSTP Solution File: SWC313-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC313-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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:40:23 EDT 2023
% Result : Unsatisfiable 0.22s 0.59s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 37 ( 16 unt; 3 nHn; 33 RR)
% Number of literals : 80 ( 42 equ; 43 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 27 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( app(X2,cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk4 ),
file('/export/starexec/sandbox2/tmp/tmp.EgJndTdjky/E---3.1_18126.p',co1_7) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.EgJndTdjky/E---3.1_18126.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.EgJndTdjky/E---3.1_18126.p',co1_5) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.EgJndTdjky/E---3.1_18126.p',clause120) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.EgJndTdjky/E---3.1_18126.p',clause109) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox2/tmp/tmp.EgJndTdjky/E---3.1_18126.p',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox2/tmp/tmp.EgJndTdjky/E---3.1_18126.p',clause13) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.EgJndTdjky/E---3.1_18126.p',co1_2) ).
cnf(co1_10,negated_conjecture,
( nil = sk2
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk2
| app(X2,cons(X1,nil)) != sk1 ),
file('/export/starexec/sandbox2/tmp/tmp.EgJndTdjky/E---3.1_18126.p',co1_10) ).
cnf(co1_8,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox2/tmp/tmp.EgJndTdjky/E---3.1_18126.p',co1_8) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.EgJndTdjky/E---3.1_18126.p',clause115) ).
cnf(co1_11,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
file('/export/starexec/sandbox2/tmp/tmp.EgJndTdjky/E---3.1_18126.p',co1_11) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.EgJndTdjky/E---3.1_18126.p',clause8) ).
cnf(c_0_13,negated_conjecture,
( app(X2,cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk4 ),
co1_7 ).
cnf(c_0_14,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_15,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_16,negated_conjecture,
( app(X1,cons(X2,nil)) = sk1
| app(cons(X2,nil),X1) != sk2
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_17,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_18,negated_conjecture,
( app(X1,cons(X2,nil)) = sk1
| cons(X2,X1) != sk2
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause109 ).
cnf(c_0_20,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_21,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_22,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_23,negated_conjecture,
( nil = sk2
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk2
| app(X2,cons(X1,nil)) != sk1 ),
co1_10 ).
cnf(c_0_24,negated_conjecture,
( app(skaf82(sk2),cons(skaf83(sk2),nil)) = sk1
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])])]),c_0_22])]) ).
cnf(c_0_25,negated_conjecture,
( sk2 = nil
| app(cons(skaf83(sk2),nil),skaf82(sk2)) != sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_20]),c_0_21])]) ).
cnf(c_0_26,negated_conjecture,
( nil = sk3
| nil != sk4 ),
co1_8 ).
cnf(c_0_27,negated_conjecture,
( sk2 = nil
| cons(skaf83(sk2),skaf82(sk2)) != sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_17]),c_0_20]),c_0_21])]) ).
cnf(c_0_28,negated_conjecture,
( sk1 = nil
| sk2 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_14]),c_0_15]) ).
cnf(c_0_29,negated_conjecture,
sk2 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_19]),c_0_22])]) ).
cnf(c_0_30,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause115 ).
cnf(c_0_31,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
co1_11 ).
cnf(c_0_32,negated_conjecture,
sk1 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_33,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_34,negated_conjecture,
neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_29]),c_0_32])]) ).
cnf(c_0_35,axiom,
ssList(nil),
clause8 ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : SWC313-1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n013.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Oct 3 01:45:46 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.51 Running first-order theorem proving
% 0.22/0.51 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.EgJndTdjky/E---3.1_18126.p
% 0.22/0.59 # Version: 3.1pre001
% 0.22/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.59 # Starting sh5l with 300s (1) cores
% 0.22/0.59 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 18204 completed with status 0
% 0.22/0.59 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.22/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.59 # No SInE strategy applied
% 0.22/0.59 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.22/0.59 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.59 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.22/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.22/0.59 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.22/0.59 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.22/0.59 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.22/0.59 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 18211 completed with status 0
% 0.22/0.59 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.22/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.59 # No SInE strategy applied
% 0.22/0.59 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.22/0.59 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.59 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.22/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.22/0.59 # Preprocessing time : 0.003 s
% 0.22/0.59 # Presaturation interreduction done
% 0.22/0.59
% 0.22/0.59 # Proof found!
% 0.22/0.59 # SZS status Unsatisfiable
% 0.22/0.59 # SZS output start CNFRefutation
% See solution above
% 0.22/0.59 # Parsed axioms : 197
% 0.22/0.59 # Removed by relevancy pruning/SinE : 0
% 0.22/0.59 # Initial clauses : 197
% 0.22/0.59 # Removed in clause preprocessing : 0
% 0.22/0.59 # Initial clauses in saturation : 197
% 0.22/0.59 # Processed clauses : 652
% 0.22/0.59 # ...of these trivial : 2
% 0.22/0.59 # ...subsumed : 154
% 0.22/0.59 # ...remaining for further processing : 496
% 0.22/0.59 # Other redundant clauses eliminated : 107
% 0.22/0.59 # Clauses deleted for lack of memory : 0
% 0.22/0.59 # Backward-subsumed : 5
% 0.22/0.59 # Backward-rewritten : 34
% 0.22/0.59 # Generated clauses : 1170
% 0.22/0.59 # ...of the previous two non-redundant : 989
% 0.22/0.59 # ...aggressively subsumed : 0
% 0.22/0.59 # Contextual simplify-reflections : 13
% 0.22/0.59 # Paramodulations : 1059
% 0.22/0.59 # Factorizations : 0
% 0.22/0.59 # NegExts : 0
% 0.22/0.59 # Equation resolutions : 112
% 0.22/0.59 # Total rewrite steps : 1237
% 0.22/0.59 # Propositional unsat checks : 0
% 0.22/0.59 # Propositional check models : 0
% 0.22/0.59 # Propositional check unsatisfiable : 0
% 0.22/0.59 # Propositional clauses : 0
% 0.22/0.59 # Propositional clauses after purity: 0
% 0.22/0.59 # Propositional unsat core size : 0
% 0.22/0.59 # Propositional preprocessing time : 0.000
% 0.22/0.59 # Propositional encoding time : 0.000
% 0.22/0.59 # Propositional solver time : 0.000
% 0.22/0.59 # Success case prop preproc time : 0.000
% 0.22/0.59 # Success case prop encoding time : 0.000
% 0.22/0.59 # Success case prop solver time : 0.000
% 0.22/0.59 # Current number of processed clauses : 245
% 0.22/0.59 # Positive orientable unit clauses : 65
% 0.22/0.59 # Positive unorientable unit clauses: 0
% 0.22/0.59 # Negative unit clauses : 2
% 0.22/0.59 # Non-unit-clauses : 178
% 0.22/0.59 # Current number of unprocessed clauses: 680
% 0.22/0.59 # ...number of literals in the above : 4037
% 0.22/0.59 # Current number of archived formulas : 0
% 0.22/0.59 # Current number of archived clauses : 228
% 0.22/0.59 # Clause-clause subsumption calls (NU) : 14322
% 0.22/0.59 # Rec. Clause-clause subsumption calls : 2106
% 0.22/0.59 # Non-unit clause-clause subsumptions : 126
% 0.22/0.59 # Unit Clause-clause subsumption calls : 147
% 0.22/0.59 # Rewrite failures with RHS unbound : 0
% 0.22/0.59 # BW rewrite match attempts : 7
% 0.22/0.59 # BW rewrite match successes : 7
% 0.22/0.59 # Condensation attempts : 0
% 0.22/0.59 # Condensation successes : 0
% 0.22/0.59 # Termbank termtop insertions : 29271
% 0.22/0.59
% 0.22/0.59 # -------------------------------------------------
% 0.22/0.59 # User time : 0.056 s
% 0.22/0.59 # System time : 0.008 s
% 0.22/0.59 # Total time : 0.064 s
% 0.22/0.59 # Maximum resident set size: 2120 pages
% 0.22/0.59
% 0.22/0.59 # -------------------------------------------------
% 0.22/0.59 # User time : 0.285 s
% 0.22/0.59 # System time : 0.026 s
% 0.22/0.59 # Total time : 0.311 s
% 0.22/0.59 # Maximum resident set size: 1852 pages
% 0.22/0.59 % E---3.1 exiting
% 0.22/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------