TSTP Solution File: SET200-6 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET200-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:18:52 EDT 2023
% Result : Unsatisfiable 970.01s 122.56s
% Output : CNFRefutation 970.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of clauses : 58 ( 20 unt; 11 nHn; 39 RR)
% Number of literals : 106 ( 6 equ; 42 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 98 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.cx7E50BuZ5/E---3.1_11677.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/tmp/tmp.cx7E50BuZ5/E---3.1_11677.p',class_elements_are_sets) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.cx7E50BuZ5/E---3.1_11677.p',complement1) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.cx7E50BuZ5/E---3.1_11677.p',not_subclass_members1) ).
cnf(prove_union_is_monotonic_2,negated_conjecture,
subclass(z,w),
file('/export/starexec/sandbox/tmp/tmp.cx7E50BuZ5/E---3.1_11677.p',prove_union_is_monotonic_2) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/tmp.cx7E50BuZ5/E---3.1_11677.p',not_subclass_members2) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.cx7E50BuZ5/E---3.1_11677.p',complement2) ).
cnf(prove_union_is_monotonic_1,negated_conjecture,
subclass(x,y),
file('/export/starexec/sandbox/tmp/tmp.cx7E50BuZ5/E---3.1_11677.p',prove_union_is_monotonic_1) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.cx7E50BuZ5/E---3.1_11677.p',intersection3) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.cx7E50BuZ5/E---3.1_11677.p',intersection1) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.cx7E50BuZ5/E---3.1_11677.p',intersection2) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.cx7E50BuZ5/E---3.1_11677.p',subclass_implies_equal) ).
cnf(prove_union_is_monotonic_3,negated_conjecture,
~ subclass(union(x,z),union(y,w)),
file('/export/starexec/sandbox/tmp/tmp.cx7E50BuZ5/E---3.1_11677.p',prove_union_is_monotonic_3) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.cx7E50BuZ5/E---3.1_11677.p',union) ).
cnf(c_0_14,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_15,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_16,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_17,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_18,negated_conjecture,
subclass(z,w),
prove_union_is_monotonic_2 ).
cnf(c_0_19,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( subclass(complement(X1),X2)
| ~ member(not_subclass_element(complement(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( member(X1,w)
| ~ member(X1,z) ),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_22,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_23,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
complement2 ).
cnf(c_0_24,plain,
( member(not_subclass_element(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_25,negated_conjecture,
subclass(x,y),
prove_union_is_monotonic_1 ).
cnf(c_0_26,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_27,negated_conjecture,
( subclass(complement(w),X1)
| ~ member(not_subclass_element(complement(w),X1),z) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( member(not_subclass_element(X1,complement(X2)),X2)
| subclass(X1,complement(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( member(X1,y)
| ~ member(X1,x) ),
inference(spm,[status(thm)],[c_0_14,c_0_25]) ).
cnf(c_0_30,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_31,plain,
( subclass(X1,intersection(X2,X3))
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X3)
| ~ member(not_subclass_element(X1,intersection(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
subclass(complement(w),complement(z)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( subclass(complement(y),X1)
| ~ member(not_subclass_element(complement(y),X1),x) ),
inference(spm,[status(thm)],[c_0_20,c_0_29]) ).
cnf(c_0_34,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X1)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_30,c_0_17]) ).
cnf(c_0_35,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_36,plain,
( subclass(X1,intersection(X2,X1))
| ~ member(not_subclass_element(X1,intersection(X2,X1)),X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_17]) ).
cnf(c_0_37,negated_conjecture,
( member(X1,complement(z))
| ~ member(X1,complement(w)) ),
inference(spm,[status(thm)],[c_0_14,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
subclass(complement(y),complement(x)),
inference(spm,[status(thm)],[c_0_33,c_0_28]) ).
cnf(c_0_39,plain,
( subclass(intersection(X1,X2),intersection(X3,X1))
| ~ member(not_subclass_element(intersection(X1,X2),intersection(X3,X1)),X3) ),
inference(spm,[status(thm)],[c_0_31,c_0_34]) ).
cnf(c_0_40,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X2)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_35,c_0_17]) ).
cnf(c_0_41,plain,
( subclass(X1,intersection(intersection(X2,X3),X1))
| ~ member(not_subclass_element(X1,intersection(intersection(X2,X3),X1)),X3)
| ~ member(not_subclass_element(X1,intersection(intersection(X2,X3),X1)),X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_26]) ).
cnf(c_0_42,negated_conjecture,
( member(not_subclass_element(intersection(complement(w),X1),X2),complement(z))
| subclass(intersection(complement(w),X1),X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_34]) ).
cnf(c_0_43,negated_conjecture,
( member(X1,complement(x))
| ~ member(X1,complement(y)) ),
inference(spm,[status(thm)],[c_0_14,c_0_38]) ).
cnf(c_0_44,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
subclass_implies_equal ).
cnf(c_0_45,plain,
subclass(intersection(X1,X2),intersection(X2,X1)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( subclass(intersection(complement(w),X1),intersection(intersection(X2,complement(z)),intersection(complement(w),X1)))
| ~ member(not_subclass_element(intersection(complement(w),X1),intersection(intersection(X2,complement(z)),intersection(complement(w),X1))),X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,negated_conjecture,
( member(not_subclass_element(intersection(X1,complement(y)),X2),complement(x))
| subclass(intersection(X1,complement(y)),X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_40]) ).
cnf(c_0_48,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_45])]) ).
cnf(c_0_49,plain,
( member(not_subclass_element(X1,complement(intersection(X2,X3))),X2)
| subclass(X1,complement(intersection(X2,X3))) ),
inference(spm,[status(thm)],[c_0_30,c_0_28]) ).
cnf(c_0_50,negated_conjecture,
subclass(intersection(complement(y),complement(w)),intersection(intersection(complement(x),complement(z)),intersection(complement(y),complement(w)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_48]) ).
cnf(c_0_51,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_22,c_0_40]) ).
cnf(c_0_52,negated_conjecture,
~ subclass(union(x,z),union(y,w)),
prove_union_is_monotonic_3 ).
cnf(c_0_53,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_54,plain,
subclass(complement(X1),complement(intersection(X1,X2))),
inference(spm,[status(thm)],[c_0_20,c_0_49]) ).
cnf(c_0_55,negated_conjecture,
intersection(intersection(complement(x),complement(z)),intersection(complement(y),complement(w))) = intersection(complement(y),complement(w)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_50]),c_0_51])]) ).
cnf(c_0_56,negated_conjecture,
~ subclass(complement(intersection(complement(x),complement(z))),complement(intersection(complement(y),complement(w)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53]),c_0_53]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.10 % Problem : SET200-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.11 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n031.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 17:18:28 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running first-order theorem proving
% 0.16/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/tmp/tmp.cx7E50BuZ5/E---3.1_11677.p
% 970.01/122.56 # Version: 3.1pre001
% 970.01/122.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 970.01/122.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 970.01/122.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 970.01/122.56 # Starting new_bool_3 with 300s (1) cores
% 970.01/122.56 # Starting new_bool_1 with 300s (1) cores
% 970.01/122.56 # Starting sh5l with 300s (1) cores
% 970.01/122.56 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 11755 completed with status 0
% 970.01/122.56 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 970.01/122.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 970.01/122.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 970.01/122.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 970.01/122.56 # No SInE strategy applied
% 970.01/122.56 # Search class: FGHSM-FFLM31-DFFFFFNN
% 970.01/122.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 970.01/122.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 970.01/122.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 970.01/122.56 # Starting new_bool_1 with 308s (1) cores
% 970.01/122.56 # Starting sh5l with 304s (1) cores
% 970.01/122.56 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 970.01/122.56 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 11763 completed with status 0
% 970.01/122.56 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 970.01/122.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 970.01/122.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 970.01/122.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 970.01/122.56 # No SInE strategy applied
% 970.01/122.56 # Search class: FGHSM-FFLM31-DFFFFFNN
% 970.01/122.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 970.01/122.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 970.01/122.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 970.01/122.56 # Preprocessing time : 0.002 s
% 970.01/122.56 # Presaturation interreduction done
% 970.01/122.56
% 970.01/122.56 # Proof found!
% 970.01/122.56 # SZS status Unsatisfiable
% 970.01/122.56 # SZS output start CNFRefutation
% See solution above
% 970.01/122.56 # Parsed axioms : 115
% 970.01/122.56 # Removed by relevancy pruning/SinE : 0
% 970.01/122.56 # Initial clauses : 115
% 970.01/122.56 # Removed in clause preprocessing : 17
% 970.01/122.56 # Initial clauses in saturation : 98
% 970.01/122.56 # Processed clauses : 121091
% 970.01/122.56 # ...of these trivial : 1785
% 970.01/122.56 # ...subsumed : 107359
% 970.01/122.56 # ...remaining for further processing : 11947
% 970.01/122.56 # Other redundant clauses eliminated : 62
% 970.01/122.56 # Clauses deleted for lack of memory : 57343
% 970.01/122.56 # Backward-subsumed : 888
% 970.01/122.56 # Backward-rewritten : 256
% 970.01/122.56 # Generated clauses : 2563353
% 970.01/122.56 # ...of the previous two non-redundant : 2220223
% 970.01/122.56 # ...aggressively subsumed : 0
% 970.01/122.56 # Contextual simplify-reflections : 184
% 970.01/122.56 # Paramodulations : 2563219
% 970.01/122.56 # Factorizations : 72
% 970.01/122.56 # NegExts : 0
% 970.01/122.56 # Equation resolutions : 62
% 970.01/122.56 # Total rewrite steps : 1139665
% 970.01/122.56 # Propositional unsat checks : 2
% 970.01/122.56 # Propositional check models : 0
% 970.01/122.56 # Propositional check unsatisfiable : 0
% 970.01/122.56 # Propositional clauses : 0
% 970.01/122.56 # Propositional clauses after purity: 0
% 970.01/122.56 # Propositional unsat core size : 0
% 970.01/122.56 # Propositional preprocessing time : 0.000
% 970.01/122.56 # Propositional encoding time : 16.737
% 970.01/122.56 # Propositional solver time : 2.455
% 970.01/122.56 # Success case prop preproc time : 0.000
% 970.01/122.56 # Success case prop encoding time : 0.000
% 970.01/122.56 # Success case prop solver time : 0.000
% 970.01/122.56 # Current number of processed clauses : 10702
% 970.01/122.56 # Positive orientable unit clauses : 835
% 970.01/122.56 # Positive unorientable unit clauses: 1
% 970.01/122.56 # Negative unit clauses : 7
% 970.01/122.56 # Non-unit-clauses : 9859
% 970.01/122.56 # Current number of unprocessed clauses: 1200328
% 970.01/122.56 # ...number of literals in the above : 4600908
% 970.01/122.56 # Current number of archived formulas : 0
% 970.01/122.56 # Current number of archived clauses : 1258
% 970.01/122.56 # Clause-clause subsumption calls (NU) : 21701322
% 970.01/122.56 # Rec. Clause-clause subsumption calls : 9784787
% 970.01/122.56 # Non-unit clause-clause subsumptions : 79529
% 970.01/122.56 # Unit Clause-clause subsumption calls : 628043
% 970.01/122.56 # Rewrite failures with RHS unbound : 0
% 970.01/122.56 # BW rewrite match attempts : 7558
% 970.01/122.56 # BW rewrite match successes : 596
% 970.01/122.56 # Condensation attempts : 0
% 970.01/122.56 # Condensation successes : 0
% 970.01/122.56 # Termbank termtop insertions : 319606055
% 970.01/122.56
% 970.01/122.56 # -------------------------------------------------
% 970.01/122.56 # User time : 119.902 s
% 970.01/122.56 # System time : 1.583 s
% 970.01/122.56 # Total time : 121.485 s
% 970.01/122.56 # Maximum resident set size: 2024 pages
% 970.01/122.56
% 970.01/122.56 # -------------------------------------------------
% 970.01/122.56 # User time : 603.230 s
% 970.01/122.56 # System time : 4.965 s
% 970.01/122.56 # Total time : 608.194 s
% 970.01/122.56 # Maximum resident set size: 1776 pages
% 970.01/122.56 % E---3.1 exiting
% 970.01/122.56 % E---3.1 exiting
%------------------------------------------------------------------------------