TSTP Solution File: SET509-6 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET509-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : Sat May 4 09:23:02 EDT 2024
% Result : Unsatisfiable 11.35s 1.81s
% Output : CNFRefutation 11.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of clauses : 66 ( 17 unt; 27 nHn; 33 RR)
% Number of literals : 133 ( 47 equ; 43 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 102 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.DbiBaKjdNV/E---3.1_30196.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/tmp/tmp.DbiBaKjdNV/E---3.1_30196.p',class_elements_are_sets) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.DbiBaKjdNV/E---3.1_30196.p',unordered_pair_member) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.DbiBaKjdNV/E---3.1_30196.p',complement1) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.DbiBaKjdNV/E---3.1_30196.p',intersection3) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox/tmp/tmp.DbiBaKjdNV/E---3.1_30196.p',regularity1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/tmp/tmp.DbiBaKjdNV/E---3.1_30196.p',singleton_set) ).
cnf(regularity2,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
file('/export/starexec/sandbox/tmp/tmp.DbiBaKjdNV/E---3.1_30196.p',regularity2) ).
cnf(prove_corollary_2_to_singleton_in_unordered_pair_1,negated_conjecture,
unordered_pair(universal_class,x) != singleton(x),
file('/export/starexec/sandbox/tmp/tmp.DbiBaKjdNV/E---3.1_30196.p',prove_corollary_2_to_singleton_in_unordered_pair_1) ).
cnf(unordered_pair3,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.DbiBaKjdNV/E---3.1_30196.p',unordered_pair3) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/tmp.DbiBaKjdNV/E---3.1_30196.p',not_subclass_members2) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.DbiBaKjdNV/E---3.1_30196.p',not_subclass_members1) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.DbiBaKjdNV/E---3.1_30196.p',subclass_implies_equal) ).
cnf(c_0_13,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_14,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
c_0_13 ).
cnf(c_0_15,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_16,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_17,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_18,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
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,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_21,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
c_0_16 ).
cnf(c_0_22,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
c_0_17 ).
cnf(c_0_23,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_24,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
c_0_18 ).
cnf(c_0_25,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( regular(unordered_pair(X1,X2)) = X1
| regular(unordered_pair(X1,X2)) = X2
| unordered_pair(X1,X2) = null_class ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_27,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_28,plain,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_23]) ).
cnf(c_0_29,plain,
( X1 = null_class
| member(regular(X1),intersection(X2,universal_class))
| ~ member(regular(X1),X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
regularity2 ).
cnf(c_0_31,plain,
( regular(unordered_pair(X1,X2)) = X1
| unordered_pair(X1,X2) = null_class
| member(X2,universal_class) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_27,c_0_25]) ).
cnf(c_0_33,plain,
( regular(singleton(X1)) = X1
| singleton(X1) = null_class ),
inference(spm,[status(thm)],[c_0_28,c_0_20]) ).
cnf(c_0_34,negated_conjecture,
unordered_pair(universal_class,x) != singleton(x),
inference(fof_simplification,[status(thm)],[prove_corollary_2_to_singleton_in_unordered_pair_1]) ).
cnf(c_0_35,plain,
( X1 = null_class
| member(regular(X1),intersection(X1,universal_class)) ),
inference(spm,[status(thm)],[c_0_29,c_0_20]) ).
cnf(c_0_36,plain,
( intersection(unordered_pair(X1,X2),X1) = null_class
| unordered_pair(X1,X2) = null_class
| member(X2,universal_class) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_32]),c_0_19]) ).
cnf(c_0_38,plain,
( singleton(X1) = null_class
| member(X1,singleton(X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_33]) ).
cnf(c_0_39,plain,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[unordered_pair3]) ).
cnf(c_0_40,negated_conjecture,
unordered_pair(universal_class,x) != singleton(x),
c_0_34 ).
cnf(c_0_41,plain,
( unordered_pair(universal_class,X1) = null_class
| member(X1,universal_class) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_42,plain,
( singleton(X1) = null_class
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_19,c_0_38]) ).
cnf(c_0_43,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_44,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_45,plain,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
c_0_39 ).
cnf(c_0_46,negated_conjecture,
member(x,universal_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_47,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
c_0_43 ).
cnf(c_0_48,plain,
( not_subclass_element(unordered_pair(X1,X2),X3) = X1
| not_subclass_element(unordered_pair(X1,X2),X3) = X2
| subclass(unordered_pair(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
member(x,unordered_pair(X1,x)),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,plain,
( not_subclass_element(unordered_pair(X1,X2),X3) = X1
| subclass(unordered_pair(X1,X2),X3)
| ~ member(X2,X3) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,negated_conjecture,
member(x,singleton(x)),
inference(spm,[status(thm)],[c_0_49,c_0_23]) ).
cnf(c_0_52,plain,
( not_subclass_element(singleton(X1),X2) = X1
| subclass(singleton(X1),X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_44]) ).
cnf(c_0_53,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_54,plain,
( member(not_subclass_element(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_44]) ).
cnf(c_0_55,negated_conjecture,
( not_subclass_element(unordered_pair(X1,x),singleton(x)) = X1
| subclass(unordered_pair(X1,x),singleton(x)) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,plain,
( subclass(singleton(X1),X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_47,c_0_52]) ).
cnf(c_0_57,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
c_0_53 ).
cnf(c_0_58,negated_conjecture,
( member(X1,universal_class)
| subclass(unordered_pair(X1,x),singleton(x)) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,negated_conjecture,
subclass(singleton(x),unordered_pair(X1,x)),
inference(spm,[status(thm)],[c_0_56,c_0_49]) ).
cnf(c_0_60,negated_conjecture,
( unordered_pair(X1,x) = singleton(x)
| member(X1,universal_class) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]) ).
cnf(c_0_61,negated_conjecture,
member(universal_class,universal_class),
inference(spm,[status(thm)],[c_0_40,c_0_60]) ).
cnf(c_0_62,plain,
( intersection(singleton(X1),X1) = null_class
| singleton(X1) = null_class ),
inference(spm,[status(thm)],[c_0_30,c_0_33]) ).
cnf(c_0_63,negated_conjecture,
member(universal_class,unordered_pair(X1,universal_class)),
inference(spm,[status(thm)],[c_0_45,c_0_61]) ).
cnf(c_0_64,plain,
singleton(universal_class) = null_class,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_62]),c_0_37]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_23]),c_0_64]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SET509-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.02/0.09 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n025.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Fri May 3 10:32:13 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.14/0.39 Running first-order model finding
% 0.14/0.39 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.DbiBaKjdNV/E---3.1_30196.p
% 11.35/1.81 # Version: 3.1.0
% 11.35/1.81 # Preprocessing class: FSLSSMSMSSSNFFN.
% 11.35/1.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.35/1.81 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 11.35/1.81 # Starting new_bool_3 with 300s (1) cores
% 11.35/1.81 # Starting new_bool_1 with 300s (1) cores
% 11.35/1.81 # Starting sh5l with 300s (1) cores
% 11.35/1.81 # sh5l with pid 30276 completed with status 0
% 11.35/1.81 # Result found by sh5l
% 11.35/1.81 # Preprocessing class: FSLSSMSMSSSNFFN.
% 11.35/1.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.35/1.81 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 11.35/1.81 # Starting new_bool_3 with 300s (1) cores
% 11.35/1.81 # Starting new_bool_1 with 300s (1) cores
% 11.35/1.81 # Starting sh5l with 300s (1) cores
% 11.35/1.81 # SinE strategy is gf500_gu_R04_F100_L20000
% 11.35/1.81 # Search class: FGHSM-FFMM31-MFFFFFNN
% 11.35/1.81 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 11.35/1.81 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 11.35/1.81 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 30279 completed with status 0
% 11.35/1.81 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 11.35/1.81 # Preprocessing class: FSLSSMSMSSSNFFN.
% 11.35/1.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.35/1.81 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 11.35/1.81 # Starting new_bool_3 with 300s (1) cores
% 11.35/1.81 # Starting new_bool_1 with 300s (1) cores
% 11.35/1.81 # Starting sh5l with 300s (1) cores
% 11.35/1.81 # SinE strategy is gf500_gu_R04_F100_L20000
% 11.35/1.81 # Search class: FGHSM-FFMM31-MFFFFFNN
% 11.35/1.81 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 11.35/1.81 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 11.35/1.81 # Preprocessing time : 0.002 s
% 11.35/1.81 # Presaturation interreduction done
% 11.35/1.81
% 11.35/1.81 # Proof found!
% 11.35/1.81 # SZS status Unsatisfiable
% 11.35/1.81 # SZS output start CNFRefutation
% See solution above
% 11.35/1.81 # Parsed axioms : 113
% 11.35/1.81 # Removed by relevancy pruning/SinE : 14
% 11.35/1.81 # Initial clauses : 99
% 11.35/1.81 # Removed in clause preprocessing : 0
% 11.35/1.81 # Initial clauses in saturation : 99
% 11.35/1.81 # Processed clauses : 4999
% 11.35/1.81 # ...of these trivial : 242
% 11.35/1.81 # ...subsumed : 2556
% 11.35/1.81 # ...remaining for further processing : 2201
% 11.35/1.81 # Other redundant clauses eliminated : 6
% 11.35/1.81 # Clauses deleted for lack of memory : 0
% 11.35/1.81 # Backward-subsumed : 129
% 11.35/1.81 # Backward-rewritten : 247
% 11.35/1.81 # Generated clauses : 108464
% 11.35/1.81 # ...of the previous two non-redundant : 87011
% 11.35/1.81 # ...aggressively subsumed : 0
% 11.35/1.81 # Contextual simplify-reflections : 6
% 11.35/1.81 # Paramodulations : 108439
% 11.35/1.81 # Factorizations : 12
% 11.35/1.81 # NegExts : 0
% 11.35/1.81 # Equation resolutions : 13
% 11.35/1.81 # Disequality decompositions : 0
% 11.35/1.81 # Total rewrite steps : 33102
% 11.35/1.81 # ...of those cached : 30178
% 11.35/1.81 # Propositional unsat checks : 0
% 11.35/1.81 # Propositional check models : 0
% 11.35/1.81 # Propositional check unsatisfiable : 0
% 11.35/1.81 # Propositional clauses : 0
% 11.35/1.81 # Propositional clauses after purity: 0
% 11.35/1.81 # Propositional unsat core size : 0
% 11.35/1.81 # Propositional preprocessing time : 0.000
% 11.35/1.81 # Propositional encoding time : 0.000
% 11.35/1.81 # Propositional solver time : 0.000
% 11.35/1.81 # Success case prop preproc time : 0.000
% 11.35/1.81 # Success case prop encoding time : 0.000
% 11.35/1.81 # Success case prop solver time : 0.000
% 11.35/1.81 # Current number of processed clauses : 1725
% 11.35/1.81 # Positive orientable unit clauses : 695
% 11.35/1.81 # Positive unorientable unit clauses: 4
% 11.35/1.81 # Negative unit clauses : 5
% 11.35/1.81 # Non-unit-clauses : 1021
% 11.35/1.81 # Current number of unprocessed clauses: 81880
% 11.35/1.81 # ...number of literals in the above : 190716
% 11.35/1.81 # Current number of archived formulas : 0
% 11.35/1.81 # Current number of archived clauses : 474
% 11.35/1.81 # Clause-clause subsumption calls (NU) : 319174
% 11.35/1.81 # Rec. Clause-clause subsumption calls : 175368
% 11.35/1.81 # Non-unit clause-clause subsumptions : 2515
% 11.35/1.81 # Unit Clause-clause subsumption calls : 114350
% 11.35/1.81 # Rewrite failures with RHS unbound : 18
% 11.35/1.81 # BW rewrite match attempts : 1379
% 11.35/1.81 # BW rewrite match successes : 135
% 11.35/1.81 # Condensation attempts : 0
% 11.35/1.81 # Condensation successes : 0
% 11.35/1.81 # Termbank termtop insertions : 1545213
% 11.35/1.81 # Search garbage collected termcells : 229
% 11.35/1.81
% 11.35/1.81 # -------------------------------------------------
% 11.35/1.81 # User time : 1.351 s
% 11.35/1.81 # System time : 0.039 s
% 11.35/1.81 # Total time : 1.390 s
% 11.35/1.81 # Maximum resident set size: 1888 pages
% 11.35/1.81
% 11.35/1.81 # -------------------------------------------------
% 11.35/1.81 # User time : 1.353 s
% 11.35/1.81 # System time : 0.041 s
% 11.35/1.81 # Total time : 1.395 s
% 11.35/1.81 # Maximum resident set size: 1788 pages
% 11.35/1.81 % E---3.1 exiting
%------------------------------------------------------------------------------