TSTP Solution File: SET508-6 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET508-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:22:53 EDT 2023
% Result : Unsatisfiable 11.21s 1.85s
% Output : CNFRefutation 11.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 14
% Syntax : Number of clauses : 61 ( 17 unt; 26 nHn; 26 RR)
% Number of literals : 119 ( 43 equ; 33 neg)
% Maximal clause size : 3 ( 1 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 : 90 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.PHYru9pjlg/E---3.1_22351.p',subclass_members) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/tmp/tmp.PHYru9pjlg/E---3.1_22351.p',class_elements_are_sets) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.PHYru9pjlg/E---3.1_22351.p',regularity1) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.PHYru9pjlg/E---3.1_22351.p',unordered_pair_member) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.PHYru9pjlg/E---3.1_22351.p',complement1) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/tmp/tmp.PHYru9pjlg/E---3.1_22351.p',singleton_set) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.PHYru9pjlg/E---3.1_22351.p',intersection3) ).
cnf(regularity2,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
file('/export/starexec/sandbox2/tmp/tmp.PHYru9pjlg/E---3.1_22351.p',regularity2) ).
cnf(prove_corollary_1_to_singleton_in_unordered_pair_1,negated_conjecture,
unordered_pair(x,universal_class) != singleton(x),
file('/export/starexec/sandbox2/tmp/tmp.PHYru9pjlg/E---3.1_22351.p',prove_corollary_1_to_singleton_in_unordered_pair_1) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.PHYru9pjlg/E---3.1_22351.p',not_subclass_members1) ).
cnf(unordered_pair3,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.PHYru9pjlg/E---3.1_22351.p',unordered_pair3) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.PHYru9pjlg/E---3.1_22351.p',not_subclass_members2) ).
cnf(unordered_pair2,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/tmp/tmp.PHYru9pjlg/E---3.1_22351.p',unordered_pair2) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.PHYru9pjlg/E---3.1_22351.p',subclass_implies_equal) ).
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,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_18,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
unordered_pair_member ).
cnf(c_0_19,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
complement1 ).
cnf(c_0_20,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_21,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
intersection3 ).
cnf(c_0_22,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,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_18,c_0_17]) ).
cnf(c_0_24,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_25,plain,
( X1 = X2
| ~ member(X1,singleton(X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_26,plain,
( X1 = null_class
| member(regular(X1),intersection(X2,universal_class))
| ~ member(regular(X1),X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
regularity2 ).
cnf(c_0_28,plain,
( regular(unordered_pair(X1,X2)) = X2
| unordered_pair(X1,X2) = null_class
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_24,c_0_22]) ).
cnf(c_0_30,plain,
( regular(singleton(X1)) = X1
| singleton(X1) = null_class ),
inference(spm,[status(thm)],[c_0_25,c_0_17]) ).
cnf(c_0_31,plain,
( X1 = null_class
| member(regular(X1),intersection(X1,universal_class)) ),
inference(spm,[status(thm)],[c_0_26,c_0_17]) ).
cnf(c_0_32,plain,
( intersection(unordered_pair(X1,X2),X2) = null_class
| unordered_pair(X1,X2) = null_class
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_29]),c_0_16]) ).
cnf(c_0_34,plain,
( singleton(X1) = null_class
| member(X1,singleton(X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
unordered_pair(x,universal_class) != singleton(x),
prove_corollary_1_to_singleton_in_unordered_pair_1 ).
cnf(c_0_36,plain,
( unordered_pair(X1,universal_class) = null_class
| member(X1,universal_class) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_37,plain,
( singleton(X1) = null_class
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_16,c_0_34]) ).
cnf(c_0_38,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_39,axiom,
( member(X1,unordered_pair(X2,X1))
| ~ member(X1,universal_class) ),
unordered_pair3 ).
cnf(c_0_40,negated_conjecture,
member(x,universal_class),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_41,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
not_subclass_members2 ).
cnf(c_0_42,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_18,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
member(x,unordered_pair(X1,x)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
( not_subclass_element(unordered_pair(X1,X2),X3) = X2
| subclass(unordered_pair(X1,X2),X3)
| ~ member(X1,X3) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
member(x,singleton(x)),
inference(spm,[status(thm)],[c_0_43,c_0_20]) ).
cnf(c_0_46,plain,
( not_subclass_element(singleton(X1),X2) = X1
| subclass(singleton(X1),X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_38]) ).
cnf(c_0_47,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
unordered_pair2 ).
cnf(c_0_48,plain,
( member(not_subclass_element(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_38]) ).
cnf(c_0_49,negated_conjecture,
( not_subclass_element(unordered_pair(x,X1),singleton(x)) = X1
| subclass(unordered_pair(x,X1),singleton(x)) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,plain,
( subclass(singleton(X1),X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_46]) ).
cnf(c_0_51,negated_conjecture,
member(x,unordered_pair(x,X1)),
inference(spm,[status(thm)],[c_0_47,c_0_40]) ).
cnf(c_0_52,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
subclass_implies_equal ).
cnf(c_0_53,negated_conjecture,
( member(X1,universal_class)
| subclass(unordered_pair(x,X1),singleton(x)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,negated_conjecture,
subclass(singleton(x),unordered_pair(x,X1)),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,negated_conjecture,
( unordered_pair(x,X1) = singleton(x)
| 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_56,negated_conjecture,
member(universal_class,universal_class),
inference(spm,[status(thm)],[c_0_35,c_0_55]) ).
cnf(c_0_57,plain,
( intersection(singleton(X1),X1) = null_class
| singleton(X1) = null_class ),
inference(spm,[status(thm)],[c_0_27,c_0_30]) ).
cnf(c_0_58,negated_conjecture,
member(universal_class,unordered_pair(X1,universal_class)),
inference(spm,[status(thm)],[c_0_39,c_0_56]) ).
cnf(c_0_59,plain,
singleton(universal_class) = null_class,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_57]),c_0_33]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_20]),c_0_59]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SET508-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.09/0.31 % Computer : n006.cluster.edu
% 0.09/0.31 % Model : x86_64 x86_64
% 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31 % Memory : 8042.1875MB
% 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31 % CPULimit : 2400
% 0.09/0.31 % WCLimit : 300
% 0.09/0.31 % DateTime : Mon Oct 2 17:53:25 EDT 2023
% 0.09/0.31 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 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.PHYru9pjlg/E---3.1_22351.p
% 11.21/1.85 # Version: 3.1pre001
% 11.21/1.85 # Preprocessing class: FSLSSMSMSSSNFFN.
% 11.21/1.85 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.21/1.85 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 11.21/1.85 # Starting new_bool_3 with 300s (1) cores
% 11.21/1.85 # Starting new_bool_1 with 300s (1) cores
% 11.21/1.85 # Starting sh5l with 300s (1) cores
% 11.21/1.85 # sh5l with pid 22433 completed with status 0
% 11.21/1.85 # Result found by sh5l
% 11.21/1.85 # Preprocessing class: FSLSSMSMSSSNFFN.
% 11.21/1.85 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.21/1.85 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 11.21/1.85 # Starting new_bool_3 with 300s (1) cores
% 11.21/1.85 # Starting new_bool_1 with 300s (1) cores
% 11.21/1.85 # Starting sh5l with 300s (1) cores
% 11.21/1.85 # SinE strategy is gf500_gu_R04_F100_L20000
% 11.21/1.85 # Search class: FGHSM-FFMM31-MFFFFFNN
% 11.21/1.85 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 11.21/1.85 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 11.21/1.85 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 22436 completed with status 0
% 11.21/1.85 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 11.21/1.85 # Preprocessing class: FSLSSMSMSSSNFFN.
% 11.21/1.85 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.21/1.85 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 11.21/1.85 # Starting new_bool_3 with 300s (1) cores
% 11.21/1.85 # Starting new_bool_1 with 300s (1) cores
% 11.21/1.85 # Starting sh5l with 300s (1) cores
% 11.21/1.85 # SinE strategy is gf500_gu_R04_F100_L20000
% 11.21/1.85 # Search class: FGHSM-FFMM31-MFFFFFNN
% 11.21/1.85 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 11.21/1.85 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 11.21/1.85 # Preprocessing time : 0.002 s
% 11.21/1.85 # Presaturation interreduction done
% 11.21/1.85
% 11.21/1.85 # Proof found!
% 11.21/1.85 # SZS status Unsatisfiable
% 11.21/1.85 # SZS output start CNFRefutation
% See solution above
% 11.21/1.85 # Parsed axioms : 113
% 11.21/1.85 # Removed by relevancy pruning/SinE : 14
% 11.21/1.85 # Initial clauses : 99
% 11.21/1.85 # Removed in clause preprocessing : 0
% 11.21/1.85 # Initial clauses in saturation : 99
% 11.21/1.85 # Processed clauses : 4919
% 11.21/1.85 # ...of these trivial : 240
% 11.21/1.85 # ...subsumed : 2499
% 11.21/1.85 # ...remaining for further processing : 2180
% 11.21/1.85 # Other redundant clauses eliminated : 6
% 11.21/1.85 # Clauses deleted for lack of memory : 0
% 11.21/1.85 # Backward-subsumed : 128
% 11.21/1.85 # Backward-rewritten : 248
% 11.21/1.85 # Generated clauses : 105496
% 11.21/1.85 # ...of the previous two non-redundant : 84676
% 11.21/1.85 # ...aggressively subsumed : 0
% 11.21/1.85 # Contextual simplify-reflections : 6
% 11.21/1.85 # Paramodulations : 105471
% 11.21/1.85 # Factorizations : 12
% 11.21/1.85 # NegExts : 0
% 11.21/1.85 # Equation resolutions : 13
% 11.21/1.85 # Total rewrite steps : 32054
% 11.21/1.85 # Propositional unsat checks : 0
% 11.21/1.85 # Propositional check models : 0
% 11.21/1.85 # Propositional check unsatisfiable : 0
% 11.21/1.85 # Propositional clauses : 0
% 11.21/1.85 # Propositional clauses after purity: 0
% 11.21/1.85 # Propositional unsat core size : 0
% 11.21/1.85 # Propositional preprocessing time : 0.000
% 11.21/1.85 # Propositional encoding time : 0.000
% 11.21/1.85 # Propositional solver time : 0.000
% 11.21/1.85 # Success case prop preproc time : 0.000
% 11.21/1.85 # Success case prop encoding time : 0.000
% 11.21/1.85 # Success case prop solver time : 0.000
% 11.21/1.85 # Current number of processed clauses : 1704
% 11.21/1.85 # Positive orientable unit clauses : 687
% 11.21/1.85 # Positive unorientable unit clauses: 4
% 11.21/1.85 # Negative unit clauses : 5
% 11.21/1.85 # Non-unit-clauses : 1008
% 11.21/1.85 # Current number of unprocessed clauses: 79628
% 11.21/1.85 # ...number of literals in the above : 186961
% 11.21/1.85 # Current number of archived formulas : 0
% 11.21/1.85 # Current number of archived clauses : 474
% 11.21/1.85 # Clause-clause subsumption calls (NU) : 308692
% 11.21/1.85 # Rec. Clause-clause subsumption calls : 172344
% 11.21/1.85 # Non-unit clause-clause subsumptions : 2458
% 11.21/1.85 # Unit Clause-clause subsumption calls : 112153
% 11.21/1.85 # Rewrite failures with RHS unbound : 18
% 11.21/1.85 # BW rewrite match attempts : 1364
% 11.21/1.85 # BW rewrite match successes : 135
% 11.21/1.85 # Condensation attempts : 0
% 11.21/1.85 # Condensation successes : 0
% 11.21/1.85 # Termbank termtop insertions : 1496127
% 11.21/1.85
% 11.21/1.85 # -------------------------------------------------
% 11.21/1.85 # User time : 1.372 s
% 11.21/1.85 # System time : 0.039 s
% 11.21/1.85 # Total time : 1.411 s
% 11.21/1.85 # Maximum resident set size: 1964 pages
% 11.21/1.85
% 11.21/1.85 # -------------------------------------------------
% 11.21/1.85 # User time : 1.374 s
% 11.21/1.85 # System time : 0.041 s
% 11.21/1.85 # Total time : 1.415 s
% 11.21/1.85 # Maximum resident set size: 1772 pages
% 11.21/1.85 % E---3.1 exiting
%------------------------------------------------------------------------------