TSTP Solution File: SWC400-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC400-1 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:29:30 EDT 2024
% Result : Unsatisfiable 1.62s 0.65s
% Output : CNFRefutation 1.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 18
% Syntax : Number of clauses : 61 ( 33 unt; 0 nHn; 55 RR)
% Number of literals : 144 ( 25 equ; 87 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 73 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause143,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause143) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause168,axiom,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause168) ).
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,
segmentP(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause48,axiom,
ssList(skaf48(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause48) ).
cnf(clause131,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause131) ).
cnf(clause49,axiom,
ssList(skaf47(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause49) ).
cnf(clause151,axiom,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause151) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(clause141,axiom,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause141) ).
cnf(co1_10,negated_conjecture,
memberP(sk1,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause140,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause140) ).
cnf(co1_9,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_11,negated_conjecture,
~ memberP(sk2,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(c_0_18,plain,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause143]) ).
cnf(c_0_19,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_20,plain,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause168]) ).
cnf(c_0_21,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_22,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_23,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_24,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_25,plain,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_18 ).
cnf(c_0_26,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_19 ).
cnf(c_0_27,plain,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_20 ).
cnf(c_0_28,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
cnf(c_0_29,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_25]),c_0_26]) ).
cnf(c_0_32,negated_conjecture,
app(app(skaf47(sk4,sk3),sk3),skaf48(sk3,sk4)) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_33,axiom,
ssList(skaf48(X1,X2)),
clause48 ).
cnf(c_0_34,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_35,negated_conjecture,
( rearsegP(sk4,skaf48(sk3,sk4))
| ~ ssList(app(skaf47(sk4,sk3),sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_36,axiom,
ssList(skaf47(X1,X2)),
clause49 ).
cnf(c_0_37,plain,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause151]) ).
cnf(c_0_38,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_34 ).
cnf(c_0_39,negated_conjecture,
rearsegP(sk4,skaf48(sk3,sk4)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_26]),c_0_36]),c_0_29])]) ).
cnf(c_0_40,plain,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_37 ).
cnf(c_0_41,negated_conjecture,
app(skaf46(sk4,skaf48(sk3,sk4)),skaf48(sk3,sk4)) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_33]),c_0_30])]) ).
cnf(c_0_42,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_43,plain,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause141]) ).
cnf(c_0_44,negated_conjecture,
memberP(sk1,sk5),
co1_10 ).
cnf(c_0_45,negated_conjecture,
( skaf46(sk4,skaf48(sk3,sk4)) = X1
| app(X1,skaf48(sk3,sk4)) != sk4
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_33]),c_0_42])]) ).
cnf(c_0_46,plain,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause140]) ).
cnf(c_0_47,plain,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
c_0_43 ).
cnf(c_0_48,negated_conjecture,
memberP(sk3,sk5),
inference(rw,[status(thm)],[c_0_44,c_0_22]) ).
cnf(c_0_49,negated_conjecture,
ssItem(sk5),
co1_9 ).
cnf(c_0_50,negated_conjecture,
( skaf46(sk4,skaf48(sk3,sk4)) = app(skaf47(sk4,sk3),sk3)
| ~ ssList(app(skaf47(sk4,sk3),sk3)) ),
inference(spm,[status(thm)],[c_0_45,c_0_32]) ).
cnf(c_0_51,plain,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
c_0_46 ).
cnf(c_0_52,negated_conjecture,
( memberP(app(X1,sk3),sk5)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_29])]) ).
cnf(c_0_53,negated_conjecture,
skaf46(sk4,skaf48(sk3,sk4)) = app(skaf47(sk4,sk3),sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_26]),c_0_36]),c_0_29])]) ).
cnf(c_0_54,negated_conjecture,
~ memberP(sk2,sk5),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_55,negated_conjecture,
( memberP(app(app(X1,sk3),X2),sk5)
| ~ ssList(app(X1,sk3))
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_49])]) ).
cnf(c_0_56,negated_conjecture,
ssList(app(skaf47(sk4,sk3),sk3)),
inference(spm,[status(thm)],[c_0_42,c_0_53]) ).
cnf(c_0_57,negated_conjecture,
~ memberP(sk2,sk5),
c_0_54 ).
cnf(c_0_58,negated_conjecture,
( memberP(app(app(skaf47(sk4,sk3),sk3),X1),sk5)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_36])]) ).
cnf(c_0_59,negated_conjecture,
~ memberP(sk4,sk5),
inference(rw,[status(thm)],[c_0_57,c_0_24]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_32]),c_0_33])]),c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SWC400-1 : TPTP v8.2.0. Released v2.4.0.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n014.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sun May 19 03:14:07 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.45 Running first-order model finding
% 0.17/0.45 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
% 1.62/0.65 # Version: 3.1.0
% 1.62/0.65 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.62/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.62/0.65 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.62/0.65 # Starting new_bool_3 with 300s (1) cores
% 1.62/0.65 # Starting new_bool_1 with 300s (1) cores
% 1.62/0.65 # Starting sh5l with 300s (1) cores
% 1.62/0.65 # sh5l with pid 20409 completed with status 0
% 1.62/0.65 # Result found by sh5l
% 1.62/0.65 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.62/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.62/0.65 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.62/0.65 # Starting new_bool_3 with 300s (1) cores
% 1.62/0.65 # Starting new_bool_1 with 300s (1) cores
% 1.62/0.65 # Starting sh5l with 300s (1) cores
% 1.62/0.65 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.62/0.65 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1.62/0.65 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 1.62/0.65 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 1.62/0.65 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 20416 completed with status 0
% 1.62/0.65 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 1.62/0.65 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.62/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.62/0.65 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.62/0.65 # Starting new_bool_3 with 300s (1) cores
% 1.62/0.65 # Starting new_bool_1 with 300s (1) cores
% 1.62/0.65 # Starting sh5l with 300s (1) cores
% 1.62/0.65 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.62/0.65 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1.62/0.65 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 1.62/0.65 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 1.62/0.65 # Preprocessing time : 0.003 s
% 1.62/0.65 # Presaturation interreduction done
% 1.62/0.65
% 1.62/0.65 # Proof found!
% 1.62/0.65 # SZS status Unsatisfiable
% 1.62/0.65 # SZS output start CNFRefutation
% See solution above
% 1.62/0.65 # Parsed axioms : 196
% 1.62/0.65 # Removed by relevancy pruning/SinE : 40
% 1.62/0.65 # Initial clauses : 156
% 1.62/0.65 # Removed in clause preprocessing : 0
% 1.62/0.65 # Initial clauses in saturation : 156
% 1.62/0.65 # Processed clauses : 1765
% 1.62/0.65 # ...of these trivial : 14
% 1.62/0.65 # ...subsumed : 927
% 1.62/0.65 # ...remaining for further processing : 824
% 1.62/0.65 # Other redundant clauses eliminated : 57
% 1.62/0.65 # Clauses deleted for lack of memory : 0
% 1.62/0.65 # Backward-subsumed : 72
% 1.62/0.65 # Backward-rewritten : 46
% 1.62/0.65 # Generated clauses : 4828
% 1.62/0.65 # ...of the previous two non-redundant : 4397
% 1.62/0.65 # ...aggressively subsumed : 0
% 1.62/0.65 # Contextual simplify-reflections : 125
% 1.62/0.65 # Paramodulations : 4765
% 1.62/0.65 # Factorizations : 0
% 1.62/0.65 # NegExts : 0
% 1.62/0.65 # Equation resolutions : 64
% 1.62/0.65 # Disequality decompositions : 0
% 1.62/0.65 # Total rewrite steps : 4267
% 1.62/0.65 # ...of those cached : 4122
% 1.62/0.65 # Propositional unsat checks : 0
% 1.62/0.65 # Propositional check models : 0
% 1.62/0.65 # Propositional check unsatisfiable : 0
% 1.62/0.65 # Propositional clauses : 0
% 1.62/0.65 # Propositional clauses after purity: 0
% 1.62/0.65 # Propositional unsat core size : 0
% 1.62/0.65 # Propositional preprocessing time : 0.000
% 1.62/0.65 # Propositional encoding time : 0.000
% 1.62/0.65 # Propositional solver time : 0.000
% 1.62/0.65 # Success case prop preproc time : 0.000
% 1.62/0.65 # Success case prop encoding time : 0.000
% 1.62/0.65 # Success case prop solver time : 0.000
% 1.62/0.65 # Current number of processed clauses : 540
% 1.62/0.65 # Positive orientable unit clauses : 73
% 1.62/0.65 # Positive unorientable unit clauses: 0
% 1.62/0.65 # Negative unit clauses : 1
% 1.62/0.65 # Non-unit-clauses : 466
% 1.62/0.65 # Current number of unprocessed clauses: 2821
% 1.62/0.65 # ...number of literals in the above : 15509
% 1.62/0.65 # Current number of archived formulas : 0
% 1.62/0.65 # Current number of archived clauses : 266
% 1.62/0.65 # Clause-clause subsumption calls (NU) : 55804
% 1.62/0.65 # Rec. Clause-clause subsumption calls : 18229
% 1.62/0.65 # Non-unit clause-clause subsumptions : 1108
% 1.62/0.65 # Unit Clause-clause subsumption calls : 725
% 1.62/0.65 # Rewrite failures with RHS unbound : 0
% 1.62/0.65 # BW rewrite match attempts : 21
% 1.62/0.65 # BW rewrite match successes : 15
% 1.62/0.65 # Condensation attempts : 0
% 1.62/0.65 # Condensation successes : 0
% 1.62/0.65 # Termbank termtop insertions : 97760
% 1.62/0.65 # Search garbage collected termcells : 623
% 1.62/0.65
% 1.62/0.65 # -------------------------------------------------
% 1.62/0.65 # User time : 0.176 s
% 1.62/0.65 # System time : 0.006 s
% 1.62/0.65 # Total time : 0.182 s
% 1.62/0.65 # Maximum resident set size: 2196 pages
% 1.62/0.65
% 1.62/0.65 # -------------------------------------------------
% 1.62/0.65 # User time : 0.181 s
% 1.62/0.65 # System time : 0.008 s
% 1.62/0.65 # Total time : 0.188 s
% 1.62/0.65 # Maximum resident set size: 1896 pages
% 1.62/0.65 % E---3.1 exiting
%------------------------------------------------------------------------------