TSTP Solution File: SWC080-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC080-1 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:23:08 EDT 2024
% Result : Unsatisfiable 1.77s 0.67s
% Output : CNFRefutation 1.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of clauses : 49 ( 19 unt; 1 nHn; 47 RR)
% Number of literals : 117 ( 14 equ; 73 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 36 ( 4 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(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(co1_14,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_16,negated_conjecture,
( neq(sk5,nil)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_18,negated_conjecture,
( frontsegP(sk3,sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_17,negated_conjecture,
( frontsegP(sk4,sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_15,negated_conjecture,
( ssList(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(c_0_15,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_16,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_17,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_18,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_19,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_15 ).
cnf(c_0_20,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_16 ).
cnf(c_0_21,axiom,
ssList(nil),
clause8 ).
cnf(c_0_22,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_23,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1)
| ~ neq(sk4,nil) ),
c_0_17 ).
cnf(c_0_24,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_25,negated_conjecture,
neq(sk2,nil),
c_0_18 ).
cnf(c_0_26,plain,
( segmentP(X1,X2)
| app(X2,X3) != X1
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_27,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_22 ).
cnf(c_0_28,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_29,negated_conjecture,
( ~ neq(X1,nil)
| ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_30,plain,
( segmentP(X1,X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])])]) ).
cnf(c_0_31,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_32,negated_conjecture,
( neq(sk5,nil)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_33,negated_conjecture,
( frontsegP(sk3,sk5)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_18]) ).
cnf(c_0_34,negated_conjecture,
( frontsegP(sk4,sk5)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_35,negated_conjecture,
( ssList(sk5)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_15]) ).
cnf(c_0_36,negated_conjecture,
( ~ neq(X1,nil)
| ~ frontsegP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_37,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_38,negated_conjecture,
( neq(sk5,nil)
| ~ neq(sk4,nil) ),
c_0_32 ).
cnf(c_0_39,negated_conjecture,
( frontsegP(sk3,sk5)
| ~ neq(sk4,nil) ),
c_0_33 ).
cnf(c_0_40,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_41,negated_conjecture,
( frontsegP(sk4,sk5)
| ~ neq(sk4,nil) ),
c_0_34 ).
cnf(c_0_42,negated_conjecture,
( ssList(sk5)
| ~ neq(sk4,nil) ),
c_0_35 ).
cnf(c_0_43,negated_conjecture,
( ~ neq(X1,nil)
| ~ frontsegP(sk1,X1)
| ~ frontsegP(sk2,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_30]),c_0_37])]) ).
cnf(c_0_44,negated_conjecture,
neq(sk5,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_24]),c_0_25])]) ).
cnf(c_0_45,negated_conjecture,
frontsegP(sk1,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_24]),c_0_25])]) ).
cnf(c_0_46,negated_conjecture,
frontsegP(sk2,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_24]),c_0_24]),c_0_25])]) ).
cnf(c_0_47,negated_conjecture,
ssList(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_24]),c_0_25])]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46]),c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC080-1 : TPTP v8.2.0. Released v2.4.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n006.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Sun May 19 03:35:23 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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
% 1.77/0.67 # Version: 3.1.0
% 1.77/0.67 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.77/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.77/0.67 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.77/0.67 # Starting new_bool_3 with 300s (1) cores
% 1.77/0.67 # Starting new_bool_1 with 300s (1) cores
% 1.77/0.67 # Starting sh5l with 300s (1) cores
% 1.77/0.67 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2935 completed with status 0
% 1.77/0.67 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.77/0.67 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.77/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.77/0.67 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.77/0.67 # No SInE strategy applied
% 1.77/0.67 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1.77/0.67 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1.77/0.67 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 1.77/0.67 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.77/0.67 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1.77/0.67 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1.77/0.67 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 1.77/0.67 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 2945 completed with status 0
% 1.77/0.67 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN
% 1.77/0.67 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.77/0.67 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.77/0.67 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.77/0.67 # No SInE strategy applied
% 1.77/0.67 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1.77/0.67 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1.77/0.67 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 1.77/0.67 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.77/0.67 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1.77/0.67 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1.77/0.67 # Preprocessing time : 0.004 s
% 1.77/0.67
% 1.77/0.67 # Proof found!
% 1.77/0.67 # SZS status Unsatisfiable
% 1.77/0.67 # SZS output start CNFRefutation
% See solution above
% 1.77/0.67 # Parsed axioms : 203
% 1.77/0.67 # Removed by relevancy pruning/SinE : 0
% 1.77/0.67 # Initial clauses : 203
% 1.77/0.67 # Removed in clause preprocessing : 0
% 1.77/0.67 # Initial clauses in saturation : 203
% 1.77/0.67 # Processed clauses : 1125
% 1.77/0.67 # ...of these trivial : 17
% 1.77/0.67 # ...subsumed : 307
% 1.77/0.67 # ...remaining for further processing : 801
% 1.77/0.67 # Other redundant clauses eliminated : 47
% 1.77/0.67 # Clauses deleted for lack of memory : 0
% 1.77/0.67 # Backward-subsumed : 22
% 1.77/0.67 # Backward-rewritten : 7
% 1.77/0.67 # Generated clauses : 8413
% 1.77/0.67 # ...of the previous two non-redundant : 8004
% 1.77/0.67 # ...aggressively subsumed : 0
% 1.77/0.67 # Contextual simplify-reflections : 36
% 1.77/0.67 # Paramodulations : 8114
% 1.77/0.67 # Factorizations : 182
% 1.77/0.67 # NegExts : 0
% 1.77/0.67 # Equation resolutions : 113
% 1.77/0.67 # Disequality decompositions : 0
% 1.77/0.67 # Total rewrite steps : 2658
% 1.77/0.67 # ...of those cached : 2443
% 1.77/0.67 # Propositional unsat checks : 0
% 1.77/0.67 # Propositional check models : 0
% 1.77/0.67 # Propositional check unsatisfiable : 0
% 1.77/0.67 # Propositional clauses : 0
% 1.77/0.67 # Propositional clauses after purity: 0
% 1.77/0.67 # Propositional unsat core size : 0
% 1.77/0.67 # Propositional preprocessing time : 0.000
% 1.77/0.67 # Propositional encoding time : 0.000
% 1.77/0.67 # Propositional solver time : 0.000
% 1.77/0.67 # Success case prop preproc time : 0.000
% 1.77/0.67 # Success case prop encoding time : 0.000
% 1.77/0.67 # Success case prop solver time : 0.000
% 1.77/0.67 # Current number of processed clauses : 763
% 1.77/0.67 # Positive orientable unit clauses : 72
% 1.77/0.67 # Positive unorientable unit clauses: 0
% 1.77/0.67 # Negative unit clauses : 8
% 1.77/0.67 # Non-unit-clauses : 683
% 1.77/0.67 # Current number of unprocessed clauses: 7048
% 1.77/0.67 # ...number of literals in the above : 26894
% 1.77/0.67 # Current number of archived formulas : 0
% 1.77/0.67 # Current number of archived clauses : 33
% 1.77/0.67 # Clause-clause subsumption calls (NU) : 49068
% 1.77/0.67 # Rec. Clause-clause subsumption calls : 13469
% 1.77/0.67 # Non-unit clause-clause subsumptions : 302
% 1.77/0.67 # Unit Clause-clause subsumption calls : 1060
% 1.77/0.67 # Rewrite failures with RHS unbound : 0
% 1.77/0.67 # BW rewrite match attempts : 2
% 1.77/0.67 # BW rewrite match successes : 2
% 1.77/0.67 # Condensation attempts : 0
% 1.77/0.67 # Condensation successes : 0
% 1.77/0.67 # Termbank termtop insertions : 138932
% 1.77/0.67 # Search garbage collected termcells : 548
% 1.77/0.67
% 1.77/0.67 # -------------------------------------------------
% 1.77/0.67 # User time : 0.206 s
% 1.77/0.67 # System time : 0.016 s
% 1.77/0.67 # Total time : 0.221 s
% 1.77/0.67 # Maximum resident set size: 2148 pages
% 1.77/0.67
% 1.77/0.67 # -------------------------------------------------
% 1.77/0.67 # User time : 1.026 s
% 1.77/0.67 # System time : 0.056 s
% 1.77/0.67 # Total time : 1.082 s
% 1.77/0.67 # Maximum resident set size: 1876 pages
% 1.77/0.67 % E---3.1 exiting
% 1.77/0.67 % E exiting
%------------------------------------------------------------------------------