TSTP Solution File: SWC384-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC384-1 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:26:13 EDT 2024
% Result : Unsatisfiable 0.50s 0.52s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 18
% Syntax : Number of clauses : 60 ( 18 unt; 22 nHn; 60 RR)
% Number of literals : 133 ( 51 equ; 62 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(co1_22,negated_conjecture,
( ~ singletonP(sk1)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_22) ).
cnf(co1_19,negated_conjecture,
( app(app(sk6,sk3),sk7) = sk4
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_19) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_16,negated_conjecture,
( ssList(sk6)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_17,negated_conjecture,
( ssList(sk7)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_18,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_9,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(co1_12,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_8,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(c_0_18,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
inference(fof_simplification,[status(thm)],[clause173]) ).
cnf(c_0_19,plain,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_20,negated_conjecture,
( ~ singletonP(sk1)
| ~ segmentP(sk2,sk1) ),
inference(fof_simplification,[status(thm)],[co1_22]) ).
cnf(c_0_21,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_18 ).
cnf(c_0_22,negated_conjecture,
( app(app(sk6,sk3),sk7) = sk4
| nil = sk3 ),
co1_19 ).
cnf(c_0_23,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_24,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_25,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_26,negated_conjecture,
( ssList(sk6)
| nil = sk3 ),
co1_16 ).
cnf(c_0_27,negated_conjecture,
( ssList(sk7)
| nil = sk3 ),
co1_17 ).
cnf(c_0_28,plain,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_19 ).
cnf(c_0_29,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
co1_18 ).
cnf(c_0_30,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
co1_9 ).
cnf(c_0_31,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_32,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
co1_12 ).
cnf(c_0_33,negated_conjecture,
( ~ singletonP(sk1)
| ~ segmentP(sk2,sk1) ),
c_0_20 ).
cnf(c_0_34,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_35,negated_conjecture,
( app(app(sk6,sk1),sk7) = sk4
| nil = sk1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_23]) ).
cnf(c_0_36,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_37,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_38,negated_conjecture,
( nil = sk1
| ssList(sk6) ),
inference(rw,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_39,negated_conjecture,
( nil = sk1
| ssList(sk7) ),
inference(rw,[status(thm)],[c_0_27,c_0_23]) ).
cnf(c_0_40,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_28]) ).
cnf(c_0_41,negated_conjecture,
( cons(sk5,nil) = sk1
| nil = sk1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_23]),c_0_23]) ).
cnf(c_0_42,negated_conjecture,
( nil = sk1
| ssItem(sk5) ),
inference(rw,[status(thm)],[c_0_30,c_0_23]) ).
cnf(c_0_43,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_31 ).
cnf(c_0_44,negated_conjecture,
( cons(sk5,nil) = sk1
| nil = sk4 ),
inference(rw,[status(thm)],[c_0_32,c_0_23]) ).
cnf(c_0_45,axiom,
ssList(nil),
clause8 ).
cnf(c_0_46,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
co1_8 ).
cnf(c_0_47,negated_conjecture,
( ~ segmentP(sk4,sk1)
| ~ singletonP(sk1) ),
inference(rw,[status(thm)],[c_0_33,c_0_25]) ).
cnf(c_0_48,negated_conjecture,
( nil = sk1
| segmentP(sk4,sk1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37])]),c_0_38]),c_0_39]) ).
cnf(c_0_49,negated_conjecture,
( nil = sk1
| singletonP(sk1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_37])]),c_0_42]) ).
cnf(c_0_50,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_51,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_52,negated_conjecture,
( nil = sk4
| nil != sk1 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]),c_0_46]) ).
cnf(c_0_53,negated_conjecture,
nil = sk1,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_54,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_50 ).
cnf(c_0_55,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_51,c_0_25]) ).
cnf(c_0_56,negated_conjecture,
sk4 = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53]),c_0_53])]) ).
cnf(c_0_57,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_54]) ).
cnf(c_0_58,negated_conjecture,
neq(sk1,sk1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_53]),c_0_56]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC384-1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 03:27:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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/benchmark/theBenchmark.p
% 0.50/0.52 # Version: 3.1.0
% 0.50/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.50/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.50/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.50/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.50/0.52 # Starting sh5l with 300s (1) cores
% 0.50/0.52 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2904 completed with status 0
% 0.50/0.52 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.50/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.50/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.50/0.52 # No SInE strategy applied
% 0.50/0.52 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.50/0.52 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.50/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.50/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.50/0.52 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.50/0.52 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.50/0.52 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.50/0.52 # G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 2912 completed with status 0
% 0.50/0.52 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.50/0.52 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.50/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.50/0.52 # No SInE strategy applied
% 0.50/0.52 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.50/0.52 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.50/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.50/0.52 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.50/0.52 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.50/0.52 # Preprocessing time : 0.003 s
% 0.50/0.52
% 0.50/0.52 # Proof found!
% 0.50/0.52 # SZS status Unsatisfiable
% 0.50/0.52 # SZS output start CNFRefutation
% See solution above
% 0.50/0.52 # Parsed axioms : 207
% 0.50/0.52 # Removed by relevancy pruning/SinE : 0
% 0.50/0.52 # Initial clauses : 207
% 0.50/0.52 # Removed in clause preprocessing : 0
% 0.50/0.52 # Initial clauses in saturation : 207
% 0.50/0.52 # Processed clauses : 255
% 0.50/0.52 # ...of these trivial : 2
% 0.50/0.52 # ...subsumed : 9
% 0.50/0.52 # ...remaining for further processing : 244
% 0.50/0.52 # Other redundant clauses eliminated : 58
% 0.50/0.52 # Clauses deleted for lack of memory : 0
% 0.50/0.52 # Backward-subsumed : 0
% 0.50/0.52 # Backward-rewritten : 69
% 0.50/0.52 # Generated clauses : 586
% 0.50/0.52 # ...of the previous two non-redundant : 537
% 0.50/0.52 # ...aggressively subsumed : 0
% 0.50/0.52 # Contextual simplify-reflections : 17
% 0.50/0.52 # Paramodulations : 524
% 0.50/0.52 # Factorizations : 0
% 0.50/0.52 # NegExts : 0
% 0.50/0.52 # Equation resolutions : 63
% 0.50/0.52 # Disequality decompositions : 0
% 0.50/0.52 # Total rewrite steps : 444
% 0.50/0.52 # ...of those cached : 394
% 0.50/0.52 # Propositional unsat checks : 0
% 0.50/0.52 # Propositional check models : 0
% 0.50/0.52 # Propositional check unsatisfiable : 0
% 0.50/0.52 # Propositional clauses : 0
% 0.50/0.52 # Propositional clauses after purity: 0
% 0.50/0.52 # Propositional unsat core size : 0
% 0.50/0.52 # Propositional preprocessing time : 0.000
% 0.50/0.52 # Propositional encoding time : 0.000
% 0.50/0.52 # Propositional solver time : 0.000
% 0.50/0.52 # Success case prop preproc time : 0.000
% 0.50/0.52 # Success case prop encoding time : 0.000
% 0.50/0.52 # Success case prop solver time : 0.000
% 0.50/0.52 # Current number of processed clauses : 152
% 0.50/0.52 # Positive orientable unit clauses : 59
% 0.50/0.52 # Positive unorientable unit clauses: 0
% 0.50/0.52 # Negative unit clauses : 2
% 0.50/0.52 # Non-unit-clauses : 91
% 0.50/0.52 # Current number of unprocessed clauses: 489
% 0.50/0.52 # ...number of literals in the above : 2324
% 0.50/0.52 # Current number of archived formulas : 0
% 0.50/0.52 # Current number of archived clauses : 69
% 0.50/0.52 # Clause-clause subsumption calls (NU) : 4830
% 0.50/0.52 # Rec. Clause-clause subsumption calls : 641
% 0.50/0.52 # Non-unit clause-clause subsumptions : 23
% 0.50/0.52 # Unit Clause-clause subsumption calls : 161
% 0.50/0.52 # Rewrite failures with RHS unbound : 0
% 0.50/0.52 # BW rewrite match attempts : 2
% 0.50/0.52 # BW rewrite match successes : 2
% 0.50/0.52 # Condensation attempts : 0
% 0.50/0.52 # Condensation successes : 0
% 0.50/0.52 # Termbank termtop insertions : 16866
% 0.50/0.52 # Search garbage collected termcells : 550
% 0.50/0.52
% 0.50/0.52 # -------------------------------------------------
% 0.50/0.52 # User time : 0.028 s
% 0.50/0.52 # System time : 0.006 s
% 0.50/0.52 # Total time : 0.034 s
% 0.50/0.52 # Maximum resident set size: 2156 pages
% 0.50/0.52
% 0.50/0.52 # -------------------------------------------------
% 0.50/0.52 # User time : 0.123 s
% 0.50/0.52 # System time : 0.021 s
% 0.50/0.52 # Total time : 0.145 s
% 0.50/0.52 # Maximum resident set size: 1880 pages
% 0.50/0.52 % E---3.1 exiting
% 0.50/0.53 % E exiting
%------------------------------------------------------------------------------