TSTP Solution File: SET497-6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET497-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 : Tue May 21 02:54:10 EDT 2024
% Result : Unsatisfiable 2.23s 0.79s
% Output : CNFRefutation 2.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 14
% Syntax : Number of clauses : 57 ( 19 unt; 12 nHn; 36 RR)
% Number of literals : 109 ( 40 equ; 50 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 100 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(domain1,axiom,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',domain1) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',singleton_set) ).
cnf(restriction1,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',restriction1) ).
cnf(restriction2,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',restriction2) ).
cnf(unordered_pair_member,axiom,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair_member) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection3) ).
cnf(regularity2,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity2) ).
cnf(unordered_pair2,axiom,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',unordered_pair2) ).
cnf(prove_russell_class1_2,negated_conjecture,
member(z,z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_russell_class1_2) ).
cnf(c_0_14,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_15,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_16,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
c_0_14 ).
cnf(c_0_17,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_18,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
c_0_15 ).
cnf(c_0_19,plain,
( X1 = null_class
| member(regular(X1),X2)
| ~ subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_21,plain,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
inference(fof_simplification,[status(thm)],[domain1]) ).
cnf(c_0_22,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_23,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_25,plain,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
c_0_21 ).
cnf(c_0_26,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_27,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_28,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
restriction2 ).
cnf(c_0_29,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
c_0_24 ).
cnf(c_0_31,plain,
( intersection(X1,cross_product(unordered_pair(X2,X2),universal_class)) != null_class
| ~ member(X2,domain_of(X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_32,plain,
intersection(cross_product(X1,X2),X3) = intersection(X3,cross_product(X1,X2)),
inference(rw,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_33,plain,
( ~ member(X1,null_class)
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_18,c_0_29]) ).
cnf(c_0_34,plain,
( intersection(X1,X2) = null_class
| member(regular(intersection(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_30,c_0_17]) ).
cnf(c_0_35,plain,
( intersection(cross_product(unordered_pair(X1,X1),universal_class),X2) != null_class
| ~ member(X1,domain_of(X2)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
intersection(X1,null_class) = null_class,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_23]) ).
cnf(c_0_37,plain,
~ member(X1,domain_of(null_class)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_38,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_39,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_40,plain,
domain_of(null_class) = null_class,
inference(spm,[status(thm)],[c_0_37,c_0_17]) ).
cnf(c_0_41,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
c_0_38 ).
cnf(c_0_42,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
c_0_39 ).
cnf(c_0_43,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
regularity2 ).
cnf(c_0_44,plain,
~ member(X1,null_class),
inference(rw,[status(thm)],[c_0_37,c_0_40]) ).
cnf(c_0_45,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_41,c_0_17]) ).
cnf(c_0_46,plain,
( X1 = null_class
| ~ member(X2,regular(X1))
| ~ member(X2,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_47,plain,
( regular(unordered_pair(X1,X1)) = X1
| unordered_pair(X1,X1) = null_class ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_45])]) ).
cnf(c_0_48,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_49,negated_conjecture,
member(z,z),
prove_russell_class1_2 ).
cnf(c_0_50,plain,
( unordered_pair(X1,X1) = null_class
| ~ member(X2,unordered_pair(X1,X1))
| ~ member(X2,X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
c_0_48 ).
cnf(c_0_52,negated_conjecture,
( member(z,X1)
| ~ subclass(z,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_49]) ).
cnf(c_0_53,plain,
( unordered_pair(X1,X1) = null_class
| ~ member(X1,universal_class)
| ~ member(X1,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
member(z,universal_class),
inference(spm,[status(thm)],[c_0_52,c_0_20]) ).
cnf(c_0_55,negated_conjecture,
unordered_pair(z,z) = null_class,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_49])]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_55]),c_0_54])]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET497-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n008.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 11:07:38 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 2.23/0.79 # Version: 3.1.0
% 2.23/0.79 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.23/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.23/0.79 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.23/0.79 # Starting new_bool_3 with 300s (1) cores
% 2.23/0.79 # Starting new_bool_1 with 300s (1) cores
% 2.23/0.79 # Starting sh5l with 300s (1) cores
% 2.23/0.79 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 14244 completed with status 0
% 2.23/0.79 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.23/0.79 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.23/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.23/0.79 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.23/0.79 # No SInE strategy applied
% 2.23/0.79 # Search class: FGHSM-FFLM31-DFFFFFNN
% 2.23/0.79 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.23/0.79 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 2.23/0.79 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.23/0.79 # Starting new_bool_1 with 308s (1) cores
% 2.23/0.79 # Starting sh5l with 304s (1) cores
% 2.23/0.79 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.23/0.79 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 14251 completed with status 0
% 2.23/0.79 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 2.23/0.79 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.23/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.23/0.79 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.23/0.79 # No SInE strategy applied
% 2.23/0.79 # Search class: FGHSM-FFLM31-DFFFFFNN
% 2.23/0.79 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.23/0.79 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 2.23/0.79 # Preprocessing time : 0.004 s
% 2.23/0.79 # Presaturation interreduction done
% 2.23/0.79
% 2.23/0.79 # Proof found!
% 2.23/0.79 # SZS status Unsatisfiable
% 2.23/0.79 # SZS output start CNFRefutation
% See solution above
% 2.23/0.79 # Parsed axioms : 114
% 2.23/0.79 # Removed by relevancy pruning/SinE : 0
% 2.23/0.79 # Initial clauses : 114
% 2.23/0.79 # Removed in clause preprocessing : 17
% 2.23/0.79 # Initial clauses in saturation : 97
% 2.23/0.79 # Processed clauses : 3542
% 2.23/0.79 # ...of these trivial : 17
% 2.23/0.79 # ...subsumed : 2394
% 2.23/0.79 # ...remaining for further processing : 1131
% 2.23/0.79 # Other redundant clauses eliminated : 12
% 2.23/0.79 # Clauses deleted for lack of memory : 0
% 2.23/0.79 # Backward-subsumed : 55
% 2.23/0.79 # Backward-rewritten : 18
% 2.23/0.79 # Generated clauses : 13890
% 2.23/0.79 # ...of the previous two non-redundant : 10747
% 2.23/0.79 # ...aggressively subsumed : 0
% 2.23/0.79 # Contextual simplify-reflections : 15
% 2.23/0.79 # Paramodulations : 13862
% 2.23/0.79 # Factorizations : 10
% 2.23/0.79 # NegExts : 0
% 2.23/0.79 # Equation resolutions : 12
% 2.23/0.79 # Disequality decompositions : 0
% 2.23/0.79 # Total rewrite steps : 7574
% 2.23/0.79 # ...of those cached : 7102
% 2.23/0.79 # Propositional unsat checks : 0
% 2.23/0.79 # Propositional check models : 0
% 2.23/0.79 # Propositional check unsatisfiable : 0
% 2.23/0.79 # Propositional clauses : 0
% 2.23/0.79 # Propositional clauses after purity: 0
% 2.23/0.79 # Propositional unsat core size : 0
% 2.23/0.79 # Propositional preprocessing time : 0.000
% 2.23/0.79 # Propositional encoding time : 0.000
% 2.23/0.79 # Propositional solver time : 0.000
% 2.23/0.79 # Success case prop preproc time : 0.000
% 2.23/0.79 # Success case prop encoding time : 0.000
% 2.23/0.79 # Success case prop solver time : 0.000
% 2.23/0.79 # Current number of processed clauses : 952
% 2.23/0.79 # Positive orientable unit clauses : 139
% 2.23/0.79 # Positive unorientable unit clauses: 1
% 2.23/0.79 # Negative unit clauses : 5
% 2.23/0.79 # Non-unit-clauses : 807
% 2.23/0.79 # Current number of unprocessed clauses: 7313
% 2.23/0.79 # ...number of literals in the above : 24480
% 2.23/0.79 # Current number of archived formulas : 0
% 2.23/0.79 # Current number of archived clauses : 192
% 2.23/0.79 # Clause-clause subsumption calls (NU) : 114805
% 2.23/0.79 # Rec. Clause-clause subsumption calls : 57827
% 2.23/0.79 # Non-unit clause-clause subsumptions : 1750
% 2.23/0.79 # Unit Clause-clause subsumption calls : 2877
% 2.23/0.79 # Rewrite failures with RHS unbound : 0
% 2.23/0.79 # BW rewrite match attempts : 84
% 2.23/0.79 # BW rewrite match successes : 13
% 2.23/0.79 # Condensation attempts : 0
% 2.23/0.79 # Condensation successes : 0
% 2.23/0.79 # Termbank termtop insertions : 342923
% 2.23/0.79 # Search garbage collected termcells : 183
% 2.23/0.79
% 2.23/0.79 # -------------------------------------------------
% 2.23/0.79 # User time : 0.283 s
% 2.23/0.79 # System time : 0.007 s
% 2.23/0.79 # Total time : 0.290 s
% 2.23/0.79 # Maximum resident set size: 2028 pages
% 2.23/0.79
% 2.23/0.79 # -------------------------------------------------
% 2.23/0.79 # User time : 1.387 s
% 2.23/0.79 # System time : 0.034 s
% 2.23/0.79 # Total time : 1.421 s
% 2.23/0.79 # Maximum resident set size: 1796 pages
% 2.23/0.79 % E---3.1 exiting
% 2.23/0.79 % E exiting
%------------------------------------------------------------------------------