TSTP Solution File: SWC378-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC378-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:11 EDT 2024
% Result : Unsatisfiable 0.14s 0.46s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 15
% Syntax : Number of clauses : 52 ( 27 unt; 9 nHn; 52 RR)
% Number of literals : 115 ( 17 equ; 58 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(co1_10,negated_conjecture,
app(sk6,sk5) = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
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_8,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_7,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_9,negated_conjecture,
app(sk5,sk6) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_12,negated_conjecture,
( memberP(sk2,sk7)
| memberP(sk1,sk7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_11,negated_conjecture,
ssItem(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(clause158,axiom,
( memberP(X2,X3)
| memberP(X1,X3)
| ~ memberP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause158) ).
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_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_13,negated_conjecture,
( ~ memberP(sk2,sk7)
| ~ memberP(sk1,sk7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(c_0_15,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_16,negated_conjecture,
app(sk6,sk5) = sk3,
co1_10 ).
cnf(c_0_17,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_18,plain,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause141]) ).
cnf(c_0_19,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_15 ).
cnf(c_0_20,negated_conjecture,
app(sk6,sk5) = sk1,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
ssList(sk6),
co1_8 ).
cnf(c_0_22,negated_conjecture,
ssList(sk5),
co1_7 ).
cnf(c_0_23,negated_conjecture,
app(sk5,sk6) = sk4,
co1_9 ).
cnf(c_0_24,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_25,plain,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
c_0_18 ).
cnf(c_0_26,negated_conjecture,
( memberP(sk2,sk7)
| memberP(sk1,sk7) ),
co1_12 ).
cnf(c_0_27,negated_conjecture,
ssItem(sk7),
co1_11 ).
cnf(c_0_28,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_29,negated_conjecture,
( app(sk6,app(sk5,X1)) = app(sk1,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_30,negated_conjecture,
app(sk5,sk6) = sk2,
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
( memberP(X2,X3)
| memberP(X1,X3)
| ~ memberP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3) ),
inference(fof_simplification,[status(thm)],[clause158]) ).
cnf(c_0_32,negated_conjecture,
( memberP(app(X1,sk2),sk7)
| memberP(sk1,sk7)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_33,negated_conjecture,
app(sk6,sk2) = app(sk1,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_21])]) ).
cnf(c_0_34,plain,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause140]) ).
cnf(c_0_35,plain,
( memberP(X2,X3)
| memberP(X1,X3)
| ~ memberP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3) ),
c_0_31 ).
cnf(c_0_36,negated_conjecture,
( memberP(app(sk1,sk6),sk7)
| memberP(sk1,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_21])]) ).
cnf(c_0_37,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_38,plain,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
c_0_34 ).
cnf(c_0_39,negated_conjecture,
( memberP(sk1,sk7)
| memberP(sk6,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_27]),c_0_21]),c_0_37])]) ).
cnf(c_0_40,negated_conjecture,
( memberP(app(sk6,X1),sk7)
| memberP(sk1,sk7)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_27]),c_0_21])]) ).
cnf(c_0_41,negated_conjecture,
memberP(sk1,sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_20]),c_0_22])]) ).
cnf(c_0_42,negated_conjecture,
( app(sk5,app(sk6,X1)) = app(sk2,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_30]),c_0_22]),c_0_21])]) ).
cnf(c_0_43,negated_conjecture,
( ~ memberP(sk2,sk7)
| ~ memberP(sk1,sk7) ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_44,negated_conjecture,
( memberP(app(X1,sk1),sk7)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_41]),c_0_27]),c_0_37])]) ).
cnf(c_0_45,negated_conjecture,
app(sk5,sk1) = app(sk2,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_20]),c_0_22])]) ).
cnf(c_0_46,negated_conjecture,
( ~ memberP(sk2,sk7)
| ~ memberP(sk1,sk7) ),
c_0_43 ).
cnf(c_0_47,negated_conjecture,
memberP(app(sk2,sk5),sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_22])]) ).
cnf(c_0_48,negated_conjecture,
~ memberP(sk2,sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_41])]) ).
cnf(c_0_49,negated_conjecture,
memberP(sk5,sk7),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_47]),c_0_27]),c_0_22]),c_0_28])]),c_0_48]) ).
cnf(c_0_50,negated_conjecture,
( memberP(app(sk5,X1),sk7)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_49]),c_0_27]),c_0_22])]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_30]),c_0_21])]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWC378-1 : TPTP v8.2.0. Released v2.4.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.10/0.29 % Computer : n024.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Sun May 19 03:54:07 EDT 2024
% 0.10/0.29 % CPUTime :
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.14/0.46 # Version: 3.1.0
% 0.14/0.46 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.46 # Starting sh5l with 300s (1) cores
% 0.14/0.46 # sh5l with pid 4692 completed with status 0
% 0.14/0.46 # Result found by sh5l
% 0.14/0.46 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.46 # Starting sh5l with 300s (1) cores
% 0.14/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.46 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.14/0.46 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.14/0.46 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 4700 completed with status 0
% 0.14/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.14/0.46 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.46 # Starting sh5l with 300s (1) cores
% 0.14/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.46 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.14/0.46 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.14/0.46 # Preprocessing time : 0.002 s
% 0.14/0.46 # Presaturation interreduction done
% 0.14/0.46
% 0.14/0.46 # Proof found!
% 0.14/0.46 # SZS status Unsatisfiable
% 0.14/0.46 # SZS output start CNFRefutation
% See solution above
% 0.14/0.46 # Parsed axioms : 198
% 0.14/0.46 # Removed by relevancy pruning/SinE : 37
% 0.14/0.46 # Initial clauses : 161
% 0.14/0.46 # Removed in clause preprocessing : 0
% 0.14/0.46 # Initial clauses in saturation : 161
% 0.14/0.46 # Processed clauses : 529
% 0.14/0.46 # ...of these trivial : 2
% 0.14/0.46 # ...subsumed : 71
% 0.14/0.46 # ...remaining for further processing : 456
% 0.14/0.46 # Other redundant clauses eliminated : 39
% 0.14/0.46 # Clauses deleted for lack of memory : 0
% 0.14/0.46 # Backward-subsumed : 3
% 0.14/0.46 # Backward-rewritten : 13
% 0.14/0.46 # Generated clauses : 970
% 0.14/0.46 # ...of the previous two non-redundant : 850
% 0.14/0.46 # ...aggressively subsumed : 0
% 0.14/0.46 # Contextual simplify-reflections : 30
% 0.14/0.46 # Paramodulations : 927
% 0.14/0.46 # Factorizations : 0
% 0.14/0.46 # NegExts : 0
% 0.14/0.46 # Equation resolutions : 44
% 0.14/0.46 # Disequality decompositions : 0
% 0.14/0.46 # Total rewrite steps : 1084
% 0.14/0.46 # ...of those cached : 1020
% 0.14/0.46 # Propositional unsat checks : 0
% 0.14/0.46 # Propositional check models : 0
% 0.14/0.46 # Propositional check unsatisfiable : 0
% 0.14/0.46 # Propositional clauses : 0
% 0.14/0.46 # Propositional clauses after purity: 0
% 0.14/0.46 # Propositional unsat core size : 0
% 0.14/0.46 # Propositional preprocessing time : 0.000
% 0.14/0.46 # Propositional encoding time : 0.000
% 0.14/0.46 # Propositional solver time : 0.000
% 0.14/0.46 # Success case prop preproc time : 0.000
% 0.14/0.46 # Success case prop encoding time : 0.000
% 0.14/0.46 # Success case prop solver time : 0.000
% 0.14/0.46 # Current number of processed clauses : 269
% 0.14/0.46 # Positive orientable unit clauses : 72
% 0.14/0.46 # Positive unorientable unit clauses: 0
% 0.14/0.46 # Negative unit clauses : 1
% 0.14/0.46 # Non-unit-clauses : 196
% 0.14/0.46 # Current number of unprocessed clauses: 617
% 0.14/0.46 # ...number of literals in the above : 3063
% 0.14/0.46 # Current number of archived formulas : 0
% 0.14/0.46 # Current number of archived clauses : 169
% 0.14/0.46 # Clause-clause subsumption calls (NU) : 12139
% 0.14/0.46 # Rec. Clause-clause subsumption calls : 2847
% 0.14/0.46 # Non-unit clause-clause subsumptions : 104
% 0.14/0.46 # Unit Clause-clause subsumption calls : 437
% 0.14/0.46 # Rewrite failures with RHS unbound : 0
% 0.14/0.46 # BW rewrite match attempts : 5
% 0.14/0.46 # BW rewrite match successes : 5
% 0.14/0.46 # Condensation attempts : 0
% 0.14/0.46 # Condensation successes : 0
% 0.14/0.46 # Termbank termtop insertions : 25609
% 0.14/0.46 # Search garbage collected termcells : 618
% 0.14/0.46
% 0.14/0.46 # -------------------------------------------------
% 0.14/0.46 # User time : 0.036 s
% 0.14/0.46 # System time : 0.005 s
% 0.14/0.46 # Total time : 0.041 s
% 0.14/0.46 # Maximum resident set size: 2212 pages
% 0.14/0.46
% 0.14/0.46 # -------------------------------------------------
% 0.14/0.46 # User time : 0.037 s
% 0.14/0.46 # System time : 0.008 s
% 0.14/0.46 # Total time : 0.045 s
% 0.14/0.46 # Maximum resident set size: 1876 pages
% 0.14/0.46 % E---3.1 exiting
% 0.14/0.46 % E exiting
%------------------------------------------------------------------------------