TSTP Solution File: SWC070-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC070-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:27:25 EDT 2024
% Result : Unsatisfiable 0.96s 0.56s
% Output : CNFRefutation 0.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of clauses : 52 ( 19 unt; 6 nHn; 50 RR)
% Number of literals : 125 ( 37 equ; 78 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 : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 45 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(co1_8,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_7,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_12,negated_conjecture,
( nil = sk3
| frontsegP(sk4,sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(co1_9,negated_conjecture,
( nil = sk4
| neq(sk3,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_10,negated_conjecture,
( nil = sk4
| frontsegP(sk4,sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause57,axiom,
( segmentP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(c_0_16,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_17,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_18,negated_conjecture,
( nil != sk2
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_19,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_16 ).
cnf(c_0_20,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_17 ).
cnf(c_0_21,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_22,negated_conjecture,
ssList(sk1),
co1_1 ).
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,
( nil != sk2
| nil != sk1 ),
c_0_18 ).
cnf(c_0_27,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_28,plain,
( nil = X1
| X2 != nil
| ~ frontsegP(X2,X1)
| ~ ssList(X1)
| ~ 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_29,negated_conjecture,
( nil = sk3
| frontsegP(sk4,sk3) ),
co1_12 ).
cnf(c_0_30,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,negated_conjecture,
( sk3 != nil
| sk4 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_23]),c_0_25]) ).
cnf(c_0_33,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_34,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_35,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ segmentP(sk2,X1)
| ~ segmentP(sk1,X1) ),
c_0_27 ).
cnf(c_0_36,negated_conjecture,
( nil = sk4
| neq(sk3,nil) ),
co1_9 ).
cnf(c_0_37,negated_conjecture,
sk4 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]),c_0_32]) ).
cnf(c_0_38,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_33 ).
cnf(c_0_39,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_34 ).
cnf(c_0_40,axiom,
ssList(nil),
clause8 ).
cnf(c_0_41,negated_conjecture,
( ~ neq(X1,nil)
| ~ segmentP(sk3,X1)
| ~ segmentP(sk4,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_23]),c_0_25]) ).
cnf(c_0_42,negated_conjecture,
neq(sk3,nil),
inference(sr,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,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_38,c_0_39]),c_0_40])]) ).
cnf(c_0_44,negated_conjecture,
( nil = sk4
| frontsegP(sk4,sk3) ),
co1_10 ).
cnf(c_0_45,negated_conjecture,
( ~ segmentP(sk3,sk3)
| ~ segmentP(sk4,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_30])]) ).
cnf(c_0_46,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_43,c_0_20]),c_0_21])])]) ).
cnf(c_0_47,negated_conjecture,
frontsegP(sk4,sk3),
inference(sr,[status(thm)],[c_0_44,c_0_37]) ).
cnf(c_0_48,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_49,negated_conjecture,
~ segmentP(sk3,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_31]),c_0_30])]) ).
cnf(c_0_50,plain,
( segmentP(X1,X1)
| ~ ssList(X1) ),
c_0_48 ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SWC070-1 : TPTP v8.2.0. Released v2.4.0.
% 0.00/0.09 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n022.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Sun May 19 02:35:07 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.14/0.39 Running first-order model finding
% 0.14/0.39 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/benchmark/theBenchmark.p
% 0.96/0.56 # Version: 3.1.0
% 0.96/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.96/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.96/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.96/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.96/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.96/0.56 # Starting sh5l with 300s (1) cores
% 0.96/0.56 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 18172 completed with status 0
% 0.96/0.56 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.96/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.96/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.96/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.96/0.56 # No SInE strategy applied
% 0.96/0.56 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.96/0.56 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.96/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.96/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.96/0.56 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.96/0.56 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.96/0.56 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.96/0.56 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 18182 completed with status 0
% 0.96/0.56 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.96/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.96/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.96/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.96/0.56 # No SInE strategy applied
% 0.96/0.56 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.96/0.56 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.96/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.96/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.96/0.56 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.96/0.56 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.96/0.56 # Preprocessing time : 0.004 s
% 0.96/0.56
% 0.96/0.56 # Proof found!
% 0.96/0.56 # SZS status Unsatisfiable
% 0.96/0.56 # SZS output start CNFRefutation
% See solution above
% 0.96/0.56 # Parsed axioms : 197
% 0.96/0.56 # Removed by relevancy pruning/SinE : 0
% 0.96/0.56 # Initial clauses : 197
% 0.96/0.56 # Removed in clause preprocessing : 0
% 0.96/0.56 # Initial clauses in saturation : 197
% 0.96/0.56 # Processed clauses : 715
% 0.96/0.56 # ...of these trivial : 9
% 0.96/0.56 # ...subsumed : 164
% 0.96/0.56 # ...remaining for further processing : 542
% 0.96/0.56 # Other redundant clauses eliminated : 41
% 0.96/0.56 # Clauses deleted for lack of memory : 0
% 0.96/0.56 # Backward-subsumed : 18
% 0.96/0.56 # Backward-rewritten : 6
% 0.96/0.56 # Generated clauses : 6108
% 0.96/0.56 # ...of the previous two non-redundant : 5907
% 0.96/0.56 # ...aggressively subsumed : 0
% 0.96/0.56 # Contextual simplify-reflections : 21
% 0.96/0.56 # Paramodulations : 5980
% 0.96/0.56 # Factorizations : 40
% 0.96/0.56 # NegExts : 0
% 0.96/0.56 # Equation resolutions : 81
% 0.96/0.56 # Disequality decompositions : 0
% 0.96/0.56 # Total rewrite steps : 2035
% 0.96/0.56 # ...of those cached : 1889
% 0.96/0.56 # Propositional unsat checks : 0
% 0.96/0.56 # Propositional check models : 0
% 0.96/0.56 # Propositional check unsatisfiable : 0
% 0.96/0.56 # Propositional clauses : 0
% 0.96/0.56 # Propositional clauses after purity: 0
% 0.96/0.56 # Propositional unsat core size : 0
% 0.96/0.56 # Propositional preprocessing time : 0.000
% 0.96/0.56 # Propositional encoding time : 0.000
% 0.96/0.56 # Propositional solver time : 0.000
% 0.96/0.56 # Success case prop preproc time : 0.000
% 0.96/0.56 # Success case prop encoding time : 0.000
% 0.96/0.56 # Success case prop solver time : 0.000
% 0.96/0.56 # Current number of processed clauses : 506
% 0.96/0.56 # Positive orientable unit clauses : 70
% 0.96/0.56 # Positive unorientable unit clauses: 0
% 0.96/0.56 # Negative unit clauses : 8
% 0.96/0.56 # Non-unit-clauses : 428
% 0.96/0.56 # Current number of unprocessed clauses: 5362
% 0.96/0.56 # ...number of literals in the above : 20276
% 0.96/0.56 # Current number of archived formulas : 0
% 0.96/0.56 # Current number of archived clauses : 31
% 0.96/0.56 # Clause-clause subsumption calls (NU) : 21378
% 0.96/0.56 # Rec. Clause-clause subsumption calls : 6150
% 0.96/0.56 # Non-unit clause-clause subsumptions : 161
% 0.96/0.56 # Unit Clause-clause subsumption calls : 1421
% 0.96/0.56 # Rewrite failures with RHS unbound : 0
% 0.96/0.56 # BW rewrite match attempts : 5
% 0.96/0.56 # BW rewrite match successes : 5
% 0.96/0.56 # Condensation attempts : 0
% 0.96/0.56 # Condensation successes : 0
% 0.96/0.56 # Termbank termtop insertions : 103799
% 0.96/0.56 # Search garbage collected termcells : 541
% 0.96/0.56
% 0.96/0.56 # -------------------------------------------------
% 0.96/0.56 # User time : 0.134 s
% 0.96/0.56 # System time : 0.009 s
% 0.96/0.56 # Total time : 0.143 s
% 0.96/0.56 # Maximum resident set size: 2144 pages
% 0.96/0.56
% 0.96/0.56 # -------------------------------------------------
% 0.96/0.56 # User time : 0.576 s
% 0.96/0.56 # System time : 0.033 s
% 0.96/0.56 # Total time : 0.609 s
% 0.96/0.56 # Maximum resident set size: 1876 pages
% 0.96/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------