TSTP Solution File: SET014-6 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET014-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:21:35 EDT 2023
% Result : Unsatisfiable 0.16s 0.59s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 14
% Syntax : Number of clauses : 73 ( 26 unt; 12 nHn; 50 RR)
% Number of literals : 129 ( 8 equ; 50 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 101 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.OotTjHzZLk/E---3.1_30530.p',subclass_members) ).
cnf(prove_least_upper_bound_2,negated_conjecture,
subclass(y,z),
file('/export/starexec/sandbox/tmp/tmp.OotTjHzZLk/E---3.1_30530.p',prove_least_upper_bound_2) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/tmp.OotTjHzZLk/E---3.1_30530.p',not_subclass_members2) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.OotTjHzZLk/E---3.1_30530.p',intersection3) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.OotTjHzZLk/E---3.1_30530.p',not_subclass_members1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/tmp/tmp.OotTjHzZLk/E---3.1_30530.p',class_elements_are_sets) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.OotTjHzZLk/E---3.1_30530.p',complement1) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.OotTjHzZLk/E---3.1_30530.p',complement2) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.OotTjHzZLk/E---3.1_30530.p',intersection1) ).
cnf(prove_least_upper_bound_1,negated_conjecture,
subclass(x,z),
file('/export/starexec/sandbox/tmp/tmp.OotTjHzZLk/E---3.1_30530.p',prove_least_upper_bound_1) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.OotTjHzZLk/E---3.1_30530.p',subclass_implies_equal) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.OotTjHzZLk/E---3.1_30530.p',intersection2) ).
cnf(prove_least_upper_bound_3,negated_conjecture,
~ subclass(union(x,y),z),
file('/export/starexec/sandbox/tmp/tmp.OotTjHzZLk/E---3.1_30530.p',prove_least_upper_bound_3) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.OotTjHzZLk/E---3.1_30530.p',union) ).
cnf(c_0_14,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_15,negated_conjecture,
subclass(y,z),
prove_least_upper_bound_2 ).
cnf(c_0_16,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_17,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_18,negated_conjecture,
( member(X1,z)
| ~ member(X1,y) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_20,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_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( member(not_subclass_element(y,X1),z)
| subclass(y,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( subclass(y,intersection(X1,z))
| ~ member(not_subclass_element(y,intersection(X1,z)),X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_24,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_25,negated_conjecture,
subclass(y,intersection(z,z)),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_26,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_23]) ).
cnf(c_0_27,plain,
( subclass(complement(X1),X2)
| ~ member(not_subclass_element(complement(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( member(X1,intersection(z,z))
| ~ member(X1,y) ),
inference(spm,[status(thm)],[c_0_14,c_0_25]) ).
cnf(c_0_29,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
complement2 ).
cnf(c_0_30,plain,
( member(not_subclass_element(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_31,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
intersection1 ).
cnf(c_0_32,negated_conjecture,
( subclass(complement(intersection(z,z)),X1)
| ~ member(not_subclass_element(complement(intersection(z,z)),X1),y) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( member(not_subclass_element(X1,complement(X2)),X2)
| subclass(X1,complement(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_29]),c_0_30]) ).
cnf(c_0_34,plain,
( subclass(X1,intersection(X2,X1))
| ~ member(not_subclass_element(X1,intersection(X2,X1)),X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_35,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X1)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_31,c_0_19]) ).
cnf(c_0_36,negated_conjecture,
subclass(x,z),
prove_least_upper_bound_1 ).
cnf(c_0_37,negated_conjecture,
subclass(complement(intersection(z,z)),complement(y)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
subclass_implies_equal ).
cnf(c_0_39,plain,
subclass(X1,intersection(X1,X1)),
inference(spm,[status(thm)],[c_0_34,c_0_19]) ).
cnf(c_0_40,plain,
subclass(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_16,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
( member(X1,z)
| ~ member(X1,x) ),
inference(spm,[status(thm)],[c_0_14,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
( member(X1,complement(y))
| ~ member(X1,complement(intersection(z,z))) ),
inference(spm,[status(thm)],[c_0_14,c_0_37]) ).
cnf(c_0_43,plain,
intersection(X1,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_44,plain,
( subclass(X1,complement(complement(X2)))
| ~ member(not_subclass_element(X1,complement(complement(X2))),X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_33]) ).
cnf(c_0_45,negated_conjecture,
( member(not_subclass_element(x,X1),z)
| subclass(x,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_19]) ).
cnf(c_0_46,negated_conjecture,
( member(X1,complement(y))
| ~ member(X1,complement(z)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
intersection2 ).
cnf(c_0_48,negated_conjecture,
subclass(x,complement(complement(z))),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
( subclass(X1,intersection(complement(y),X1))
| ~ member(not_subclass_element(X1,intersection(complement(y),X1)),complement(z)) ),
inference(spm,[status(thm)],[c_0_34,c_0_46]) ).
cnf(c_0_50,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X2)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_47,c_0_19]) ).
cnf(c_0_51,negated_conjecture,
( member(X1,complement(complement(z)))
| ~ member(X1,x) ),
inference(spm,[status(thm)],[c_0_14,c_0_48]) ).
cnf(c_0_52,negated_conjecture,
subclass(complement(z),intersection(complement(y),complement(z))),
inference(spm,[status(thm)],[c_0_49,c_0_19]) ).
cnf(c_0_53,plain,
subclass(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_16,c_0_50]) ).
cnf(c_0_54,negated_conjecture,
( ~ member(X1,complement(z))
| ~ member(X1,x) ),
inference(spm,[status(thm)],[c_0_24,c_0_51]) ).
cnf(c_0_55,negated_conjecture,
intersection(complement(y),complement(z)) = complement(z),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_52]),c_0_53])]) ).
cnf(c_0_56,negated_conjecture,
( subclass(complement(z),X1)
| ~ member(not_subclass_element(complement(z),X1),x) ),
inference(spm,[status(thm)],[c_0_54,c_0_19]) ).
cnf(c_0_57,negated_conjecture,
( member(not_subclass_element(complement(z),X1),complement(y))
| subclass(complement(z),X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
subclass(complement(z),complement(x)),
inference(spm,[status(thm)],[c_0_56,c_0_33]) ).
cnf(c_0_59,negated_conjecture,
( subclass(complement(z),intersection(X1,complement(y)))
| ~ member(not_subclass_element(complement(z),intersection(X1,complement(y))),X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_57]) ).
cnf(c_0_60,negated_conjecture,
( member(X1,complement(x))
| ~ member(X1,complement(z)) ),
inference(spm,[status(thm)],[c_0_14,c_0_58]) ).
cnf(c_0_61,negated_conjecture,
subclass(complement(z),intersection(complement(x),complement(y))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_19]) ).
cnf(c_0_62,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_44,c_0_19]) ).
cnf(c_0_63,plain,
( member(not_subclass_element(complement(complement(X1)),X2),X1)
| subclass(complement(complement(X1)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_29]),c_0_30]) ).
cnf(c_0_64,negated_conjecture,
( member(X1,intersection(complement(x),complement(y)))
| ~ member(X1,complement(z)) ),
inference(spm,[status(thm)],[c_0_14,c_0_61]) ).
cnf(c_0_65,plain,
( complement(complement(X1)) = X1
| ~ subclass(complement(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_62]) ).
cnf(c_0_66,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_16,c_0_63]) ).
cnf(c_0_67,negated_conjecture,
~ subclass(union(x,y),z),
prove_least_upper_bound_3 ).
cnf(c_0_68,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_69,negated_conjecture,
( subclass(complement(intersection(complement(x),complement(y))),X1)
| ~ member(not_subclass_element(complement(intersection(complement(x),complement(y))),X1),complement(z)) ),
inference(spm,[status(thm)],[c_0_27,c_0_64]) ).
cnf(c_0_70,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66])]) ).
cnf(c_0_71,negated_conjecture,
~ subclass(complement(intersection(complement(x),complement(y))),z),
inference(rw,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_33]),c_0_70]),c_0_71]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : SET014-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.05/0.12 % Command : run_E %s %d THM
% 0.10/0.32 % Computer : n006.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 2400
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon Oct 2 16:29:55 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running first-order model finding
% 0.16/0.43 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.OotTjHzZLk/E---3.1_30530.p
% 0.16/0.59 # Version: 3.1pre001
% 0.16/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.59 # Starting sh5l with 300s (1) cores
% 0.16/0.59 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 30608 completed with status 0
% 0.16/0.59 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.59 # No SInE strategy applied
% 0.16/0.59 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.16/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.59 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.16/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.59 # Starting new_bool_1 with 308s (1) cores
% 0.16/0.59 # Starting sh5l with 304s (1) cores
% 0.16/0.59 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.59 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 30616 completed with status 0
% 0.16/0.59 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.16/0.59 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.59 # No SInE strategy applied
% 0.16/0.59 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.16/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.59 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.16/0.59 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.16/0.59 # Preprocessing time : 0.003 s
% 0.16/0.59 # Presaturation interreduction done
% 0.16/0.59
% 0.16/0.59 # Proof found!
% 0.16/0.59 # SZS status Unsatisfiable
% 0.16/0.59 # SZS output start CNFRefutation
% See solution above
% 0.16/0.59 # Parsed axioms : 115
% 0.16/0.59 # Removed by relevancy pruning/SinE : 0
% 0.16/0.59 # Initial clauses : 115
% 0.16/0.59 # Removed in clause preprocessing : 17
% 0.16/0.59 # Initial clauses in saturation : 98
% 0.16/0.59 # Processed clauses : 1830
% 0.16/0.59 # ...of these trivial : 13
% 0.16/0.59 # ...subsumed : 967
% 0.16/0.59 # ...remaining for further processing : 850
% 0.16/0.59 # Other redundant clauses eliminated : 8
% 0.16/0.59 # Clauses deleted for lack of memory : 0
% 0.16/0.59 # Backward-subsumed : 32
% 0.16/0.59 # Backward-rewritten : 152
% 0.16/0.59 # Generated clauses : 4701
% 0.16/0.59 # ...of the previous two non-redundant : 4185
% 0.16/0.59 # ...aggressively subsumed : 0
% 0.16/0.59 # Contextual simplify-reflections : 14
% 0.16/0.59 # Paramodulations : 4689
% 0.16/0.59 # Factorizations : 4
% 0.16/0.59 # NegExts : 0
% 0.16/0.59 # Equation resolutions : 8
% 0.16/0.59 # Total rewrite steps : 1286
% 0.16/0.59 # Propositional unsat checks : 0
% 0.16/0.59 # Propositional check models : 0
% 0.16/0.59 # Propositional check unsatisfiable : 0
% 0.16/0.59 # Propositional clauses : 0
% 0.16/0.59 # Propositional clauses after purity: 0
% 0.16/0.59 # Propositional unsat core size : 0
% 0.16/0.59 # Propositional preprocessing time : 0.000
% 0.16/0.59 # Propositional encoding time : 0.000
% 0.16/0.59 # Propositional solver time : 0.000
% 0.16/0.59 # Success case prop preproc time : 0.000
% 0.16/0.59 # Success case prop encoding time : 0.000
% 0.16/0.59 # Success case prop solver time : 0.000
% 0.16/0.59 # Current number of processed clauses : 565
% 0.16/0.59 # Positive orientable unit clauses : 91
% 0.16/0.59 # Positive unorientable unit clauses: 1
% 0.16/0.59 # Negative unit clauses : 3
% 0.16/0.59 # Non-unit-clauses : 470
% 0.16/0.59 # Current number of unprocessed clauses: 2312
% 0.16/0.59 # ...number of literals in the above : 7212
% 0.16/0.59 # Current number of archived formulas : 0
% 0.16/0.59 # Current number of archived clauses : 298
% 0.16/0.59 # Clause-clause subsumption calls (NU) : 51628
% 0.16/0.59 # Rec. Clause-clause subsumption calls : 31873
% 0.16/0.59 # Non-unit clause-clause subsumptions : 883
% 0.16/0.59 # Unit Clause-clause subsumption calls : 2893
% 0.16/0.59 # Rewrite failures with RHS unbound : 0
% 0.16/0.59 # BW rewrite match attempts : 161
% 0.16/0.59 # BW rewrite match successes : 44
% 0.16/0.59 # Condensation attempts : 0
% 0.16/0.59 # Condensation successes : 0
% 0.16/0.59 # Termbank termtop insertions : 182199
% 0.16/0.59
% 0.16/0.59 # -------------------------------------------------
% 0.16/0.59 # User time : 0.137 s
% 0.16/0.59 # System time : 0.005 s
% 0.16/0.59 # Total time : 0.142 s
% 0.16/0.59 # Maximum resident set size: 2004 pages
% 0.16/0.59
% 0.16/0.59 # -------------------------------------------------
% 0.16/0.59 # User time : 0.689 s
% 0.16/0.59 # System time : 0.019 s
% 0.16/0.59 # Total time : 0.708 s
% 0.16/0.59 # Maximum resident set size: 1772 pages
% 0.16/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------