TSTP Solution File: SWC378-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---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 : n021.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:21 EDT 2024
% Result : Unsatisfiable 0.20s 0.54s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 15
% Syntax : Number of clauses : 54 ( 27 unt; 10 nHn; 54 RR)
% Number of literals : 119 ( 16 equ; 60 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_12,negated_conjecture,
( memberP(sk2,sk7)
| memberP(sk1,sk7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
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_11,negated_conjecture,
ssItem(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_9,negated_conjecture,
app(sk5,sk6) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
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,negated_conjecture,
( memberP(sk2,sk7)
| memberP(sk1,sk7) ),
co1_12 ).
cnf(c_0_20,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_21,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_22,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_15 ).
cnf(c_0_23,negated_conjecture,
app(sk6,sk5) = sk1,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
ssList(sk6),
co1_8 ).
cnf(c_0_25,negated_conjecture,
ssList(sk5),
co1_7 ).
cnf(c_0_26,plain,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
c_0_18 ).
cnf(c_0_27,negated_conjecture,
( memberP(sk4,sk7)
| memberP(sk1,sk7) ),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,negated_conjecture,
ssItem(sk7),
co1_11 ).
cnf(c_0_29,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_30,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_22,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_31,negated_conjecture,
app(sk5,sk6) = sk4,
co1_9 ).
cnf(c_0_32,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_33,negated_conjecture,
( memberP(app(X1,sk4),sk7)
| memberP(sk1,sk7)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]) ).
cnf(c_0_34,negated_conjecture,
app(sk6,sk4) = app(sk1,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_24])]) ).
cnf(c_0_35,plain,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause140]) ).
cnf(c_0_36,plain,
( memberP(X2,X3)
| memberP(X1,X3)
| ~ memberP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3) ),
c_0_32 ).
cnf(c_0_37,negated_conjecture,
( memberP(app(sk1,sk6),sk7)
| memberP(sk1,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_24])]) ).
cnf(c_0_38,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_39,plain,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
c_0_35 ).
cnf(c_0_40,negated_conjecture,
( memberP(sk6,sk7)
| memberP(sk1,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_28]),c_0_24]),c_0_38])]) ).
cnf(c_0_41,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_39,c_0_40]),c_0_28]),c_0_24])]) ).
cnf(c_0_42,negated_conjecture,
( ~ memberP(sk2,sk7)
| ~ memberP(sk1,sk7) ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_43,negated_conjecture,
memberP(sk1,sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_23]),c_0_25])]) ).
cnf(c_0_44,negated_conjecture,
( app(sk5,app(sk6,X1)) = app(sk4,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_31]),c_0_25]),c_0_24])]) ).
cnf(c_0_45,negated_conjecture,
( ~ memberP(sk2,sk7)
| ~ memberP(sk1,sk7) ),
c_0_42 ).
cnf(c_0_46,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_26,c_0_43]),c_0_28]),c_0_38])]) ).
cnf(c_0_47,negated_conjecture,
app(sk5,sk1) = app(sk4,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_23]),c_0_25])]) ).
cnf(c_0_48,negated_conjecture,
( ~ memberP(sk1,sk7)
| ~ memberP(sk4,sk7) ),
inference(rw,[status(thm)],[c_0_45,c_0_20]) ).
cnf(c_0_49,negated_conjecture,
memberP(app(sk4,sk5),sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_25])]) ).
cnf(c_0_50,negated_conjecture,
~ memberP(sk4,sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_43])]) ).
cnf(c_0_51,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_36,c_0_49]),c_0_28]),c_0_25]),c_0_29])]),c_0_50]) ).
cnf(c_0_52,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_39,c_0_51]),c_0_28]),c_0_25])]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_31]),c_0_24])]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC378-1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 03:54:08 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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.20/0.54 # Version: 3.1.0
% 0.20/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54 # Starting sh5l with 300s (1) cores
% 0.20/0.54 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 28358 completed with status 0
% 0.20/0.54 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.54 # No SInE strategy applied
% 0.20/0.54 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.20/0.54 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.20/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.54 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.20/0.54 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.20/0.54 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.20/0.54 # G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 28366 completed with status 0
% 0.20/0.54 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.20/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.54 # No SInE strategy applied
% 0.20/0.54 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.20/0.54 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.20/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.54 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.20/0.54 # Preprocessing time : 0.003 s
% 0.20/0.54
% 0.20/0.54 # Proof found!
% 0.20/0.54 # SZS status Unsatisfiable
% 0.20/0.54 # SZS output start CNFRefutation
% See solution above
% 0.20/0.54 # Parsed axioms : 198
% 0.20/0.54 # Removed by relevancy pruning/SinE : 0
% 0.20/0.54 # Initial clauses : 198
% 0.20/0.54 # Removed in clause preprocessing : 0
% 0.20/0.54 # Initial clauses in saturation : 198
% 0.20/0.54 # Processed clauses : 667
% 0.20/0.54 # ...of these trivial : 2
% 0.20/0.54 # ...subsumed : 218
% 0.20/0.54 # ...remaining for further processing : 447
% 0.20/0.54 # Other redundant clauses eliminated : 80
% 0.20/0.54 # Clauses deleted for lack of memory : 0
% 0.20/0.54 # Backward-subsumed : 1
% 0.20/0.54 # Backward-rewritten : 39
% 0.20/0.54 # Generated clauses : 1634
% 0.20/0.54 # ...of the previous two non-redundant : 1464
% 0.20/0.54 # ...aggressively subsumed : 0
% 0.20/0.54 # Contextual simplify-reflections : 12
% 0.20/0.54 # Paramodulations : 1548
% 0.20/0.54 # Factorizations : 0
% 0.20/0.54 # NegExts : 0
% 0.20/0.54 # Equation resolutions : 87
% 0.20/0.54 # Disequality decompositions : 0
% 0.20/0.54 # Total rewrite steps : 2059
% 0.20/0.54 # ...of those cached : 1947
% 0.20/0.54 # Propositional unsat checks : 0
% 0.20/0.54 # Propositional check models : 0
% 0.20/0.54 # Propositional check unsatisfiable : 0
% 0.20/0.54 # Propositional clauses : 0
% 0.20/0.54 # Propositional clauses after purity: 0
% 0.20/0.54 # Propositional unsat core size : 0
% 0.20/0.54 # Propositional preprocessing time : 0.000
% 0.20/0.54 # Propositional encoding time : 0.000
% 0.20/0.54 # Propositional solver time : 0.000
% 0.20/0.54 # Success case prop preproc time : 0.000
% 0.20/0.54 # Success case prop encoding time : 0.000
% 0.20/0.54 # Success case prop solver time : 0.000
% 0.20/0.54 # Current number of processed clauses : 384
% 0.20/0.54 # Positive orientable unit clauses : 104
% 0.20/0.54 # Positive unorientable unit clauses: 0
% 0.20/0.54 # Negative unit clauses : 3
% 0.20/0.54 # Non-unit-clauses : 277
% 0.20/0.54 # Current number of unprocessed clauses: 959
% 0.20/0.54 # ...number of literals in the above : 4631
% 0.20/0.54 # Current number of archived formulas : 0
% 0.20/0.54 # Current number of archived clauses : 40
% 0.20/0.54 # Clause-clause subsumption calls (NU) : 14324
% 0.20/0.54 # Rec. Clause-clause subsumption calls : 4423
% 0.20/0.54 # Non-unit clause-clause subsumptions : 200
% 0.20/0.54 # Unit Clause-clause subsumption calls : 547
% 0.20/0.54 # Rewrite failures with RHS unbound : 0
% 0.20/0.54 # BW rewrite match attempts : 12
% 0.20/0.54 # BW rewrite match successes : 10
% 0.20/0.54 # Condensation attempts : 0
% 0.20/0.54 # Condensation successes : 0
% 0.20/0.54 # Termbank termtop insertions : 36363
% 0.20/0.54 # Search garbage collected termcells : 530
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.045 s
% 0.20/0.54 # System time : 0.009 s
% 0.20/0.54 # Total time : 0.054 s
% 0.20/0.54 # Maximum resident set size: 2136 pages
% 0.20/0.54
% 0.20/0.54 # -------------------------------------------------
% 0.20/0.54 # User time : 0.236 s
% 0.20/0.54 # System time : 0.031 s
% 0.20/0.54 # Total time : 0.267 s
% 0.20/0.54 # Maximum resident set size: 1876 pages
% 0.20/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------