TSTP Solution File: SWC229-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC229-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:39:59 EDT 2023
% Result : Unsatisfiable 0.17s 0.52s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 18
% Syntax : Number of clauses : 49 ( 20 unt; 2 nHn; 47 RR)
% Number of literals : 107 ( 30 equ; 67 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 38 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4Cg1REUJMg/E---3.1_32707.p',clause71) ).
cnf(co1_11,negated_conjecture,
( memberP(X3,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
file('/export/starexec/sandbox2/tmp/tmp.4Cg1REUJMg/E---3.1_32707.p',co1_11) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.4Cg1REUJMg/E---3.1_32707.p',clause8) ).
cnf(co1_9,negated_conjecture,
( ssItem(sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
file('/export/starexec/sandbox2/tmp/tmp.4Cg1REUJMg/E---3.1_32707.p',co1_9) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4Cg1REUJMg/E---3.1_32707.p',clause74) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4Cg1REUJMg/E---3.1_32707.p',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/tmp/tmp.4Cg1REUJMg/E---3.1_32707.p',clause47) ).
cnf(co1_14,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.4Cg1REUJMg/E---3.1_32707.p',co1_14) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.4Cg1REUJMg/E---3.1_32707.p',co1_6) ).
cnf(co1_7,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox2/tmp/tmp.4Cg1REUJMg/E---3.1_32707.p',co1_7) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.4Cg1REUJMg/E---3.1_32707.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.4Cg1REUJMg/E---3.1_32707.p',co1_5) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/tmp/tmp.4Cg1REUJMg/E---3.1_32707.p',co1_1) ).
cnf(clause127,axiom,
( X2 = X1
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.4Cg1REUJMg/E---3.1_32707.p',clause127) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.4Cg1REUJMg/E---3.1_32707.p',clause100) ).
cnf(co1_8,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox2/tmp/tmp.4Cg1REUJMg/E---3.1_32707.p',co1_8) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4Cg1REUJMg/E---3.1_32707.p',clause56) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4Cg1REUJMg/E---3.1_32707.p',clause73) ).
cnf(c_0_18,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_19,negated_conjecture,
( memberP(X3,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
co1_11 ).
cnf(c_0_20,axiom,
ssList(nil),
clause8 ).
cnf(c_0_21,negated_conjecture,
( app(app(X1,cons(X2,nil)),nil) != sk1
| ~ ssItem(sk5(nil,X1,X2))
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_22,negated_conjecture,
( ssItem(sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
co1_9 ).
cnf(c_0_23,negated_conjecture,
( app(app(X1,cons(X2,nil)),nil) != sk1
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_20])]) ).
cnf(c_0_24,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_25,negated_conjecture,
( app(cons(X1,nil),nil) != sk1
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_20])]) ).
cnf(c_0_26,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
clause101 ).
cnf(c_0_27,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_28,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
co1_14 ).
cnf(c_0_29,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_30,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
cnf(c_0_31,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_32,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_33,negated_conjecture,
( app(X1,nil) != sk1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_34,negated_conjecture,
( singletonP(sk1)
| ~ neq(sk4,nil) ),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_36,axiom,
( X2 = X1
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause127 ).
cnf(c_0_37,negated_conjecture,
segmentP(sk4,sk1),
inference(rw,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_38,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
( app(sk1,nil) != sk1
| ~ neq(sk4,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_40,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_41,negated_conjecture,
( sk4 = sk1
| ~ segmentP(sk1,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_35])]) ).
cnf(c_0_42,negated_conjecture,
( sk4 = nil
| app(sk1,nil) != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_38]),c_0_20])]) ).
cnf(c_0_43,negated_conjecture,
nil != sk1,
co1_8 ).
cnf(c_0_44,negated_conjecture,
( app(sk1,nil) != sk1
| ~ segmentP(sk1,nil) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_45,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
clause56 ).
cnf(c_0_46,negated_conjecture,
app(sk1,nil) != sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_35])]) ).
cnf(c_0_47,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC229-1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Oct 3 01:45:51 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.17/0.46 Running first-order theorem proving
% 0.17/0.46 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.4Cg1REUJMg/E---3.1_32707.p
% 0.17/0.52 # Version: 3.1pre001
% 0.17/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.52 # Starting sh5l with 300s (1) cores
% 0.17/0.52 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 317 completed with status 0
% 0.17/0.52 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.17/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.52 # No SInE strategy applied
% 0.17/0.52 # Search class: FGHSM-FSLM31-MFFFFFNN
% 0.17/0.52 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 675s (1) cores
% 0.17/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.17/0.52 # Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.17/0.52 # Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.52 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 136s (1) cores
% 0.17/0.52 # G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with pid 325 completed with status 0
% 0.17/0.52 # Result found by G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y
% 0.17/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.52 # No SInE strategy applied
% 0.17/0.52 # Search class: FGHSM-FSLM31-MFFFFFNN
% 0.17/0.52 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 675s (1) cores
% 0.17/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.17/0.52 # Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.17/0.52 # Preprocessing time : 0.003 s
% 0.17/0.52 # Presaturation interreduction done
% 0.17/0.52
% 0.17/0.52 # Proof found!
% 0.17/0.52 # SZS status Unsatisfiable
% 0.17/0.52 # SZS output start CNFRefutation
% See solution above
% 0.17/0.52 # Parsed axioms : 199
% 0.17/0.52 # Removed by relevancy pruning/SinE : 0
% 0.17/0.52 # Initial clauses : 199
% 0.17/0.52 # Removed in clause preprocessing : 0
% 0.17/0.52 # Initial clauses in saturation : 199
% 0.17/0.52 # Processed clauses : 427
% 0.17/0.52 # ...of these trivial : 2
% 0.17/0.52 # ...subsumed : 11
% 0.17/0.52 # ...remaining for further processing : 414
% 0.17/0.52 # Other redundant clauses eliminated : 82
% 0.17/0.52 # Clauses deleted for lack of memory : 0
% 0.17/0.52 # Backward-subsumed : 5
% 0.17/0.52 # Backward-rewritten : 0
% 0.17/0.52 # Generated clauses : 878
% 0.17/0.52 # ...of the previous two non-redundant : 714
% 0.17/0.52 # ...aggressively subsumed : 0
% 0.17/0.52 # Contextual simplify-reflections : 4
% 0.17/0.52 # Paramodulations : 778
% 0.17/0.52 # Factorizations : 0
% 0.17/0.52 # NegExts : 0
% 0.17/0.52 # Equation resolutions : 100
% 0.17/0.52 # Total rewrite steps : 710
% 0.17/0.52 # Propositional unsat checks : 0
% 0.17/0.52 # Propositional check models : 0
% 0.17/0.52 # Propositional check unsatisfiable : 0
% 0.17/0.52 # Propositional clauses : 0
% 0.17/0.52 # Propositional clauses after purity: 0
% 0.17/0.52 # Propositional unsat core size : 0
% 0.17/0.52 # Propositional preprocessing time : 0.000
% 0.17/0.52 # Propositional encoding time : 0.000
% 0.17/0.52 # Propositional solver time : 0.000
% 0.17/0.52 # Success case prop preproc time : 0.000
% 0.17/0.52 # Success case prop encoding time : 0.000
% 0.17/0.52 # Success case prop solver time : 0.000
% 0.17/0.52 # Current number of processed clauses : 211
% 0.17/0.52 # Positive orientable unit clauses : 57
% 0.17/0.52 # Positive unorientable unit clauses: 0
% 0.17/0.52 # Negative unit clauses : 4
% 0.17/0.52 # Non-unit-clauses : 150
% 0.17/0.52 # Current number of unprocessed clauses: 679
% 0.17/0.52 # ...number of literals in the above : 4379
% 0.17/0.52 # Current number of archived formulas : 0
% 0.17/0.52 # Current number of archived clauses : 198
% 0.17/0.52 # Clause-clause subsumption calls (NU) : 9890
% 0.17/0.52 # Rec. Clause-clause subsumption calls : 1216
% 0.17/0.52 # Non-unit clause-clause subsumptions : 15
% 0.17/0.52 # Unit Clause-clause subsumption calls : 19
% 0.17/0.52 # Rewrite failures with RHS unbound : 0
% 0.17/0.52 # BW rewrite match attempts : 0
% 0.17/0.52 # BW rewrite match successes : 0
% 0.17/0.52 # Condensation attempts : 0
% 0.17/0.52 # Condensation successes : 0
% 0.17/0.52 # Termbank termtop insertions : 23605
% 0.17/0.52
% 0.17/0.52 # -------------------------------------------------
% 0.17/0.52 # User time : 0.037 s
% 0.17/0.52 # System time : 0.007 s
% 0.17/0.52 # Total time : 0.045 s
% 0.17/0.52 # Maximum resident set size: 2104 pages
% 0.17/0.52
% 0.17/0.52 # -------------------------------------------------
% 0.17/0.52 # User time : 0.191 s
% 0.17/0.52 # System time : 0.019 s
% 0.17/0.52 # Total time : 0.209 s
% 0.17/0.52 # Maximum resident set size: 1852 pages
% 0.17/0.52 % E---3.1 exiting
% 0.17/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------