TSTP Solution File: SWC379-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC379-1 : TPTP v8.1.2. 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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:42:52 EDT 2023
% Result : Unsatisfiable 0.20s 0.51s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of clauses : 57 ( 13 unt; 18 nHn; 57 RR)
% Number of literals : 161 ( 19 equ; 91 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 24 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_11,negated_conjecture,
( memberP(sk4,X1)
| ~ ssItem(X1)
| ~ memberP(sk3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.9Ei5YoTap7/E---3.1_11203.p',co1_11) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.9Ei5YoTap7/E---3.1_11203.p',co1_6) ).
cnf(co1_14,negated_conjecture,
( memberP(sk1,sk6)
| memberP(sk2,sk6) ),
file('/export/starexec/sandbox/tmp/tmp.9Ei5YoTap7/E---3.1_11203.p',co1_14) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/tmp/tmp.9Ei5YoTap7/E---3.1_11203.p',co1_5) ).
cnf(co1_9,negated_conjecture,
( memberP(sk3,X1)
| leq(sk5(X1),X1)
| ~ ssItem(X1)
| ~ memberP(sk4,X1) ),
file('/export/starexec/sandbox/tmp/tmp.9Ei5YoTap7/E---3.1_11203.p',co1_9) ).
cnf(co1_13,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox/tmp/tmp.9Ei5YoTap7/E---3.1_11203.p',co1_13) ).
cnf(co1_7,negated_conjecture,
( memberP(sk3,X1)
| ssItem(sk5(X1))
| ~ ssItem(X1)
| ~ memberP(sk4,X1) ),
file('/export/starexec/sandbox/tmp/tmp.9Ei5YoTap7/E---3.1_11203.p',co1_7) ).
cnf(co1_8,negated_conjecture,
( memberP(sk3,X1)
| memberP(sk4,sk5(X1))
| ~ ssItem(X1)
| ~ memberP(sk4,X1) ),
file('/export/starexec/sandbox/tmp/tmp.9Ei5YoTap7/E---3.1_11203.p',co1_8) ).
cnf(co1_10,negated_conjecture,
( memberP(sk3,X1)
| ~ ssItem(X1)
| X1 != sk5(X1)
| ~ memberP(sk4,X1) ),
file('/export/starexec/sandbox/tmp/tmp.9Ei5YoTap7/E---3.1_11203.p',co1_10) ).
cnf(co1_18,negated_conjecture,
( leq(sk7,sk6)
| ~ memberP(sk2,sk6)
| ~ memberP(sk1,sk6) ),
file('/export/starexec/sandbox/tmp/tmp.9Ei5YoTap7/E---3.1_11203.p',co1_18) ).
cnf(co1_15,negated_conjecture,
( memberP(sk1,sk6)
| sk6 = X1
| ~ ssItem(X1)
| ~ memberP(sk2,X1)
| ~ leq(X1,sk6) ),
file('/export/starexec/sandbox/tmp/tmp.9Ei5YoTap7/E---3.1_11203.p',co1_15) ).
cnf(co1_17,negated_conjecture,
( memberP(sk2,sk7)
| ~ memberP(sk2,sk6)
| ~ memberP(sk1,sk6) ),
file('/export/starexec/sandbox/tmp/tmp.9Ei5YoTap7/E---3.1_11203.p',co1_17) ).
cnf(co1_16,negated_conjecture,
( ssItem(sk7)
| ~ memberP(sk2,sk6)
| ~ memberP(sk1,sk6) ),
file('/export/starexec/sandbox/tmp/tmp.9Ei5YoTap7/E---3.1_11203.p',co1_16) ).
cnf(co1_19,negated_conjecture,
( sk6 != sk7
| ~ memberP(sk2,sk6)
| ~ memberP(sk1,sk6) ),
file('/export/starexec/sandbox/tmp/tmp.9Ei5YoTap7/E---3.1_11203.p',co1_19) ).
cnf(co1_12,negated_conjecture,
( X1 = X2
| ~ ssItem(X1)
| ~ memberP(sk3,X1)
| ~ ssItem(X2)
| ~ memberP(sk4,X2)
| ~ leq(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.9Ei5YoTap7/E---3.1_11203.p',co1_12) ).
cnf(c_0_15,negated_conjecture,
( memberP(sk4,X1)
| ~ ssItem(X1)
| ~ memberP(sk3,X1) ),
co1_11 ).
cnf(c_0_16,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_17,negated_conjecture,
( memberP(sk1,sk6)
| memberP(sk2,sk6) ),
co1_14 ).
cnf(c_0_18,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_19,negated_conjecture,
( memberP(sk3,X1)
| leq(sk5(X1),X1)
| ~ ssItem(X1)
| ~ memberP(sk4,X1) ),
co1_9 ).
cnf(c_0_20,negated_conjecture,
( memberP(sk4,X1)
| ~ memberP(sk1,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( memberP(sk4,sk6)
| memberP(sk1,sk6) ),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
ssItem(sk6),
co1_13 ).
cnf(c_0_23,negated_conjecture,
( memberP(sk3,X1)
| ssItem(sk5(X1))
| ~ ssItem(X1)
| ~ memberP(sk4,X1) ),
co1_7 ).
cnf(c_0_24,negated_conjecture,
( memberP(sk3,X1)
| memberP(sk4,sk5(X1))
| ~ ssItem(X1)
| ~ memberP(sk4,X1) ),
co1_8 ).
cnf(c_0_25,negated_conjecture,
( memberP(sk3,X1)
| ~ ssItem(X1)
| X1 != sk5(X1)
| ~ memberP(sk4,X1) ),
co1_10 ).
cnf(c_0_26,negated_conjecture,
( leq(sk7,sk6)
| ~ memberP(sk2,sk6)
| ~ memberP(sk1,sk6) ),
co1_18 ).
cnf(c_0_27,negated_conjecture,
( memberP(sk1,sk6)
| sk6 = X1
| ~ ssItem(X1)
| ~ memberP(sk2,X1)
| ~ leq(X1,sk6) ),
co1_15 ).
cnf(c_0_28,negated_conjecture,
( memberP(sk1,X1)
| leq(sk5(X1),X1)
| ~ memberP(sk4,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_29,negated_conjecture,
memberP(sk4,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_30,negated_conjecture,
( memberP(sk1,X1)
| ssItem(sk5(X1))
| ~ memberP(sk4,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_23,c_0_16]) ).
cnf(c_0_31,negated_conjecture,
( memberP(sk4,sk5(X1))
| memberP(sk1,X1)
| ~ memberP(sk4,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_24,c_0_16]) ).
cnf(c_0_32,negated_conjecture,
( memberP(sk1,X1)
| sk5(X1) != X1
| ~ memberP(sk4,X1)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_25,c_0_16]) ).
cnf(c_0_33,negated_conjecture,
( memberP(sk2,sk7)
| ~ memberP(sk2,sk6)
| ~ memberP(sk1,sk6) ),
co1_17 ).
cnf(c_0_34,negated_conjecture,
( ssItem(sk7)
| ~ memberP(sk2,sk6)
| ~ memberP(sk1,sk6) ),
co1_16 ).
cnf(c_0_35,negated_conjecture,
( sk6 != sk7
| ~ memberP(sk2,sk6)
| ~ memberP(sk1,sk6) ),
co1_19 ).
cnf(c_0_36,negated_conjecture,
( leq(sk7,sk6)
| ~ memberP(sk1,sk6)
| ~ memberP(sk4,sk6) ),
inference(rw,[status(thm)],[c_0_26,c_0_18]) ).
cnf(c_0_37,negated_conjecture,
( sk6 = X1
| memberP(sk1,sk6)
| ~ memberP(sk4,X1)
| ~ leq(X1,sk6)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_27,c_0_18]) ).
cnf(c_0_38,negated_conjecture,
( memberP(sk1,sk6)
| leq(sk5(sk6),sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_22])]) ).
cnf(c_0_39,negated_conjecture,
( memberP(sk1,sk6)
| ssItem(sk5(sk6)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_29]),c_0_22])]) ).
cnf(c_0_40,negated_conjecture,
( memberP(sk4,sk5(sk6))
| memberP(sk1,sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_29]),c_0_22])]) ).
cnf(c_0_41,negated_conjecture,
( memberP(sk1,sk6)
| sk5(sk6) != sk6 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_29]),c_0_22])]) ).
cnf(c_0_42,negated_conjecture,
( memberP(sk4,sk7)
| ~ memberP(sk1,sk6)
| ~ memberP(sk4,sk6) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_18]),c_0_18]) ).
cnf(c_0_43,negated_conjecture,
( ssItem(sk7)
| ~ memberP(sk1,sk6)
| ~ memberP(sk4,sk6) ),
inference(rw,[status(thm)],[c_0_34,c_0_18]) ).
cnf(c_0_44,negated_conjecture,
( sk7 != sk6
| ~ memberP(sk1,sk6)
| ~ memberP(sk4,sk6) ),
inference(rw,[status(thm)],[c_0_35,c_0_18]) ).
cnf(c_0_45,negated_conjecture,
( X1 = X2
| ~ ssItem(X1)
| ~ memberP(sk3,X1)
| ~ ssItem(X2)
| ~ memberP(sk4,X2)
| ~ leq(X2,X1) ),
co1_12 ).
cnf(c_0_46,negated_conjecture,
( leq(sk7,sk6)
| ~ memberP(sk1,sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_29])]) ).
cnf(c_0_47,negated_conjecture,
memberP(sk1,sk6),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40]),c_0_41]) ).
cnf(c_0_48,negated_conjecture,
( memberP(sk4,sk7)
| ~ memberP(sk1,sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_29])]) ).
cnf(c_0_49,negated_conjecture,
( ssItem(sk7)
| ~ memberP(sk1,sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_29])]) ).
cnf(c_0_50,negated_conjecture,
( sk7 != sk6
| ~ memberP(sk1,sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_29])]) ).
cnf(c_0_51,negated_conjecture,
( X1 = X2
| ~ memberP(sk1,X1)
| ~ memberP(sk4,X2)
| ~ leq(X2,X1)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_45,c_0_16]) ).
cnf(c_0_52,negated_conjecture,
leq(sk7,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]) ).
cnf(c_0_53,negated_conjecture,
memberP(sk4,sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_47])]) ).
cnf(c_0_54,negated_conjecture,
ssItem(sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_47])]) ).
cnf(c_0_55,negated_conjecture,
sk7 != sk6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_47])]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_47]),c_0_53]),c_0_54]),c_0_22])]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC379-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 01:37:24 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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/tmp/tmp.9Ei5YoTap7/E---3.1_11203.p
% 0.20/0.51 # Version: 3.1pre001
% 0.20/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.51 # Starting sh5l with 300s (1) cores
% 0.20/0.51 # new_bool_3 with pid 11281 completed with status 0
% 0.20/0.51 # Result found by new_bool_3
% 0.20/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.20/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 11284 completed with status 0
% 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.20/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.51 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.20/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.20/0.51 # Preprocessing time : 0.003 s
% 0.20/0.51 # Presaturation interreduction done
% 0.20/0.51
% 0.20/0.51 # Proof found!
% 0.20/0.51 # SZS status Unsatisfiable
% 0.20/0.51 # SZS output start CNFRefutation
% See solution above
% 0.20/0.51 # Parsed axioms : 204
% 0.20/0.51 # Removed by relevancy pruning/SinE : 149
% 0.20/0.51 # Initial clauses : 55
% 0.20/0.51 # Removed in clause preprocessing : 0
% 0.20/0.51 # Initial clauses in saturation : 55
% 0.20/0.51 # Processed clauses : 123
% 0.20/0.51 # ...of these trivial : 2
% 0.20/0.51 # ...subsumed : 2
% 0.20/0.51 # ...remaining for further processing : 119
% 0.20/0.51 # Other redundant clauses eliminated : 9
% 0.20/0.51 # Clauses deleted for lack of memory : 0
% 0.20/0.51 # Backward-subsumed : 0
% 0.20/0.51 # Backward-rewritten : 16
% 0.20/0.51 # Generated clauses : 92
% 0.20/0.51 # ...of the previous two non-redundant : 76
% 0.20/0.51 # ...aggressively subsumed : 0
% 0.20/0.51 # Contextual simplify-reflections : 6
% 0.20/0.51 # Paramodulations : 80
% 0.20/0.51 # Factorizations : 0
% 0.20/0.51 # NegExts : 0
% 0.20/0.51 # Equation resolutions : 13
% 0.20/0.51 # Total rewrite steps : 95
% 0.20/0.51 # Propositional unsat checks : 0
% 0.20/0.51 # Propositional check models : 0
% 0.20/0.51 # Propositional check unsatisfiable : 0
% 0.20/0.51 # Propositional clauses : 0
% 0.20/0.51 # Propositional clauses after purity: 0
% 0.20/0.51 # Propositional unsat core size : 0
% 0.20/0.51 # Propositional preprocessing time : 0.000
% 0.20/0.51 # Propositional encoding time : 0.000
% 0.20/0.51 # Propositional solver time : 0.000
% 0.20/0.51 # Success case prop preproc time : 0.000
% 0.20/0.51 # Success case prop encoding time : 0.000
% 0.20/0.51 # Success case prop solver time : 0.000
% 0.20/0.51 # Current number of processed clauses : 48
% 0.20/0.51 # Positive orientable unit clauses : 12
% 0.20/0.51 # Positive unorientable unit clauses: 0
% 0.20/0.51 # Negative unit clauses : 1
% 0.20/0.51 # Non-unit-clauses : 35
% 0.20/0.51 # Current number of unprocessed clauses: 58
% 0.20/0.51 # ...number of literals in the above : 237
% 0.20/0.51 # Current number of archived formulas : 0
% 0.20/0.51 # Current number of archived clauses : 67
% 0.20/0.51 # Clause-clause subsumption calls (NU) : 507
% 0.20/0.51 # Rec. Clause-clause subsumption calls : 113
% 0.20/0.51 # Non-unit clause-clause subsumptions : 8
% 0.20/0.51 # Unit Clause-clause subsumption calls : 11
% 0.20/0.51 # Rewrite failures with RHS unbound : 0
% 0.20/0.51 # BW rewrite match attempts : 2
% 0.20/0.51 # BW rewrite match successes : 2
% 0.20/0.51 # Condensation attempts : 0
% 0.20/0.51 # Condensation successes : 0
% 0.20/0.51 # Termbank termtop insertions : 4877
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.012 s
% 0.20/0.51 # System time : 0.002 s
% 0.20/0.51 # Total time : 0.014 s
% 0.20/0.51 # Maximum resident set size: 1964 pages
% 0.20/0.51
% 0.20/0.51 # -------------------------------------------------
% 0.20/0.51 # User time : 0.017 s
% 0.20/0.51 # System time : 0.003 s
% 0.20/0.51 # Total time : 0.020 s
% 0.20/0.51 # Maximum resident set size: 1860 pages
% 0.20/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------