TSTP Solution File: SET513-6 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET513-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:22:53 EDT 2023
% Result : Unsatisfiable 21.64s 3.16s
% Output : CNFRefutation 21.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of clauses : 61 ( 23 unt; 20 nHn; 32 RR)
% Number of literals : 110 ( 37 equ; 33 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 83 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4Rs1HaDE3v/E---3.1_7186.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.4Rs1HaDE3v/E---3.1_7186.p',class_elements_are_sets) ).
cnf(inductive1,axiom,
( member(null_class,X1)
| ~ inductive(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4Rs1HaDE3v/E---3.1_7186.p',inductive1) ).
cnf(omega_is_inductive1,axiom,
inductive(omega),
file('/export/starexec/sandbox2/tmp/tmp.4Rs1HaDE3v/E---3.1_7186.p',omega_is_inductive1) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4Rs1HaDE3v/E---3.1_7186.p',regularity1) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.4Rs1HaDE3v/E---3.1_7186.p',unordered_pair_member) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/tmp/tmp.4Rs1HaDE3v/E---3.1_7186.p',singleton_set) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.4Rs1HaDE3v/E---3.1_7186.p',complement1) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.4Rs1HaDE3v/E---3.1_7186.p',intersection3) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.4Rs1HaDE3v/E---3.1_7186.p',not_subclass_members1) ).
cnf(unordered_pair3,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.4Rs1HaDE3v/E---3.1_7186.p',unordered_pair3) ).
cnf(regularity2,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
file('/export/starexec/sandbox2/tmp/tmp.4Rs1HaDE3v/E---3.1_7186.p',regularity2) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.4Rs1HaDE3v/E---3.1_7186.p',not_subclass_members2) ).
cnf(ordered_pair,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
file('/export/starexec/sandbox2/tmp/tmp.4Rs1HaDE3v/E---3.1_7186.p',ordered_pair) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4Rs1HaDE3v/E---3.1_7186.p',subclass_implies_equal) ).
cnf(prove_corollary_3_to_property_1_of_ordered_pair_1,negated_conjecture,
ordered_pair(universal_class,universal_class) != unordered_pair(null_class,singleton(null_class)),
file('/export/starexec/sandbox2/tmp/tmp.4Rs1HaDE3v/E---3.1_7186.p',prove_corollary_3_to_property_1_of_ordered_pair_1) ).
cnf(c_0_16,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
subclass_members ).
cnf(c_0_17,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_18,axiom,
( member(null_class,X1)
| ~ inductive(X1) ),
inductive1 ).
cnf(c_0_19,axiom,
inductive(omega),
omega_is_inductive1 ).
cnf(c_0_20,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_22,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_23,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_24,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_25,plain,
member(null_class,omega),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_27,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_30,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_31,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
unordered_pair3 ).
cnf(c_0_32,plain,
member(null_class,universal_class),
inference(spm,[status(thm)],[c_0_20,c_0_25]) ).
cnf(c_0_33,plain,
( X1 = null_class
| member(regular(X1),intersection(X2,universal_class))
| ~ member(regular(X1),X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
regularity2 ).
cnf(c_0_35,plain,
( regular(singleton(X1)) = X1
| singleton(X1) = null_class ),
inference(spm,[status(thm)],[c_0_28,c_0_21]) ).
cnf(c_0_36,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_29,c_0_27]) ).
cnf(c_0_37,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_38,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_22,c_0_30]) ).
cnf(c_0_39,plain,
member(null_class,unordered_pair(X1,null_class)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_40,plain,
( X1 = null_class
| member(regular(X1),intersection(X1,universal_class)) ),
inference(spm,[status(thm)],[c_0_33,c_0_21]) ).
cnf(c_0_41,plain,
( intersection(singleton(X1),X1) = null_class
| singleton(X1) = null_class ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_36]),c_0_20]) ).
cnf(c_0_43,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_37,c_0_38]) ).
cnf(c_0_44,plain,
member(null_class,singleton(null_class)),
inference(spm,[status(thm)],[c_0_39,c_0_23]) ).
cnf(c_0_45,plain,
( not_subclass_element(singleton(X1),X2) = X1
| subclass(singleton(X1),X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_30]) ).
cnf(c_0_46,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
ordered_pair ).
cnf(c_0_47,plain,
singleton(universal_class) = null_class,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_48,plain,
( member(not_subclass_element(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_30]) ).
cnf(c_0_49,plain,
( not_subclass_element(unordered_pair(X1,null_class),singleton(null_class)) = X1
| subclass(unordered_pair(X1,null_class),singleton(null_class)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_50,plain,
( subclass(singleton(X1),X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_45]) ).
cnf(c_0_51,plain,
unordered_pair(null_class,unordered_pair(universal_class,singleton(X1))) = ordered_pair(universal_class,X1),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
subclass_implies_equal ).
cnf(c_0_53,plain,
( member(X1,universal_class)
| subclass(unordered_pair(X1,null_class),singleton(null_class)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,plain,
subclass(singleton(null_class),unordered_pair(X1,null_class)),
inference(spm,[status(thm)],[c_0_50,c_0_39]) ).
cnf(c_0_55,plain,
unordered_pair(null_class,unordered_pair(universal_class,null_class)) = ordered_pair(universal_class,universal_class),
inference(spm,[status(thm)],[c_0_51,c_0_47]) ).
cnf(c_0_56,plain,
( unordered_pair(X1,null_class) = singleton(null_class)
| member(X1,universal_class) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]) ).
cnf(c_0_57,negated_conjecture,
ordered_pair(universal_class,universal_class) != unordered_pair(null_class,singleton(null_class)),
prove_corollary_3_to_property_1_of_ordered_pair_1 ).
cnf(c_0_58,plain,
member(universal_class,universal_class),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_59,plain,
member(universal_class,unordered_pair(X1,universal_class)),
inference(spm,[status(thm)],[c_0_31,c_0_58]) ).
cnf(c_0_60,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_23]),c_0_47]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SET513-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.10/0.29 % Computer : n023.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % 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:45:07 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.4Rs1HaDE3v/E---3.1_7186.p
% 21.64/3.16 # Version: 3.1pre001
% 21.64/3.16 # Preprocessing class: FSLSSMSMSSSNFFN.
% 21.64/3.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.64/3.16 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 21.64/3.16 # Starting new_bool_3 with 300s (1) cores
% 21.64/3.16 # Starting new_bool_1 with 300s (1) cores
% 21.64/3.16 # Starting sh5l with 300s (1) cores
% 21.64/3.16 # sh5l with pid 7266 completed with status 0
% 21.64/3.16 # Result found by sh5l
% 21.64/3.16 # Preprocessing class: FSLSSMSMSSSNFFN.
% 21.64/3.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.64/3.16 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 21.64/3.16 # Starting new_bool_3 with 300s (1) cores
% 21.64/3.16 # Starting new_bool_1 with 300s (1) cores
% 21.64/3.16 # Starting sh5l with 300s (1) cores
% 21.64/3.16 # SinE strategy is gf500_gu_R04_F100_L20000
% 21.64/3.16 # Search class: FGHSM-FFMM31-MFFFFFNN
% 21.64/3.16 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 21.64/3.16 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 21.64/3.16 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 7269 completed with status 0
% 21.64/3.16 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 21.64/3.16 # Preprocessing class: FSLSSMSMSSSNFFN.
% 21.64/3.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.64/3.16 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 21.64/3.16 # Starting new_bool_3 with 300s (1) cores
% 21.64/3.16 # Starting new_bool_1 with 300s (1) cores
% 21.64/3.16 # Starting sh5l with 300s (1) cores
% 21.64/3.16 # SinE strategy is gf500_gu_R04_F100_L20000
% 21.64/3.16 # Search class: FGHSM-FFMM31-MFFFFFNN
% 21.64/3.16 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 21.64/3.16 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 21.64/3.16 # Preprocessing time : 0.002 s
% 21.64/3.16 # Presaturation interreduction done
% 21.64/3.16
% 21.64/3.16 # Proof found!
% 21.64/3.16 # SZS status Unsatisfiable
% 21.64/3.16 # SZS output start CNFRefutation
% See solution above
% 21.64/3.16 # Parsed axioms : 113
% 21.64/3.16 # Removed by relevancy pruning/SinE : 14
% 21.64/3.16 # Initial clauses : 99
% 21.64/3.16 # Removed in clause preprocessing : 0
% 21.64/3.16 # Initial clauses in saturation : 99
% 21.64/3.16 # Processed clauses : 6361
% 21.64/3.16 # ...of these trivial : 640
% 21.64/3.16 # ...subsumed : 2443
% 21.64/3.16 # ...remaining for further processing : 3278
% 21.64/3.16 # Other redundant clauses eliminated : 6
% 21.64/3.16 # Clauses deleted for lack of memory : 0
% 21.64/3.16 # Backward-subsumed : 170
% 21.64/3.16 # Backward-rewritten : 354
% 21.64/3.16 # Generated clauses : 216680
% 21.64/3.16 # ...of the previous two non-redundant : 161302
% 21.64/3.16 # ...aggressively subsumed : 0
% 21.64/3.16 # Contextual simplify-reflections : 4
% 21.64/3.16 # Paramodulations : 216652
% 21.64/3.16 # Factorizations : 16
% 21.64/3.16 # NegExts : 0
% 21.64/3.16 # Equation resolutions : 12
% 21.64/3.16 # Total rewrite steps : 82579
% 21.64/3.16 # Propositional unsat checks : 0
% 21.64/3.16 # Propositional check models : 0
% 21.64/3.16 # Propositional check unsatisfiable : 0
% 21.64/3.16 # Propositional clauses : 0
% 21.64/3.16 # Propositional clauses after purity: 0
% 21.64/3.16 # Propositional unsat core size : 0
% 21.64/3.16 # Propositional preprocessing time : 0.000
% 21.64/3.16 # Propositional encoding time : 0.000
% 21.64/3.16 # Propositional solver time : 0.000
% 21.64/3.16 # Success case prop preproc time : 0.000
% 21.64/3.16 # Success case prop encoding time : 0.000
% 21.64/3.16 # Success case prop solver time : 0.000
% 21.64/3.16 # Current number of processed clauses : 2654
% 21.64/3.16 # Positive orientable unit clauses : 1335
% 21.64/3.16 # Positive unorientable unit clauses: 4
% 21.64/3.16 # Negative unit clauses : 14
% 21.64/3.16 # Non-unit-clauses : 1301
% 21.64/3.16 # Current number of unprocessed clauses: 154493
% 21.64/3.16 # ...number of literals in the above : 323343
% 21.64/3.16 # Current number of archived formulas : 0
% 21.64/3.16 # Current number of archived clauses : 622
% 21.64/3.16 # Clause-clause subsumption calls (NU) : 290491
% 21.64/3.16 # Rec. Clause-clause subsumption calls : 186096
% 21.64/3.16 # Non-unit clause-clause subsumptions : 2243
% 21.64/3.16 # Unit Clause-clause subsumption calls : 76493
% 21.64/3.16 # Rewrite failures with RHS unbound : 18
% 21.64/3.16 # BW rewrite match attempts : 3277
% 21.64/3.16 # BW rewrite match successes : 212
% 21.64/3.16 # Condensation attempts : 0
% 21.64/3.16 # Condensation successes : 0
% 21.64/3.16 # Termbank termtop insertions : 3433858
% 21.64/3.16
% 21.64/3.16 # -------------------------------------------------
% 21.64/3.16 # User time : 2.510 s
% 21.64/3.16 # System time : 0.101 s
% 21.64/3.16 # Total time : 2.612 s
% 21.64/3.16 # Maximum resident set size: 1948 pages
% 21.64/3.16
% 21.64/3.16 # -------------------------------------------------
% 21.64/3.16 # User time : 2.513 s
% 21.64/3.16 # System time : 0.103 s
% 21.64/3.16 # Total time : 2.616 s
% 21.64/3.16 # Maximum resident set size: 1772 pages
% 21.64/3.16 % E---3.1 exiting
%------------------------------------------------------------------------------