TSTP Solution File: SET511-6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET511-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:12 EDT 2024
% Result : Unsatisfiable 0.20s 0.58s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of clauses : 61 ( 23 unt; 14 nHn; 35 RR)
% Number of literals : 111 ( 49 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 : 12 ( 12 usr; 3 con; 0-3 aty)
% Number of variables : 105 ( 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_corollary_1_to_property_1_of_ordered_pair_1,negated_conjecture,
unordered_pair(singleton(x),unordered_pair(x,null_class)) != ordered_pair(x,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_1_to_property_1_of_ordered_pair_1) ).
cnf(ordered_pair,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',ordered_pair) ).
cnf(c_0_15,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_16,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_17,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
c_0_15 ).
cnf(c_0_18,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_19,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
c_0_16 ).
cnf(c_0_20,plain,
( X1 = null_class
| member(regular(X1),X2)
| ~ subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_22,plain,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
inference(fof_simplification,[status(thm)],[domain1]) ).
cnf(c_0_23,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_24,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_26,plain,
( restrict(X1,singleton(X2),universal_class) != null_class
| ~ member(X2,domain_of(X1)) ),
c_0_22 ).
cnf(c_0_27,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_28,axiom,
intersection(X1,cross_product(X2,X3)) = restrict(X1,X2,X3),
restriction1 ).
cnf(c_0_29,axiom,
intersection(cross_product(X1,X2),X3) = restrict(X3,X1,X2),
restriction2 ).
cnf(c_0_30,plain,
complement(universal_class) = null_class,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
c_0_25 ).
cnf(c_0_32,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_33,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_26,c_0_27]),c_0_28]) ).
cnf(c_0_34,plain,
intersection(cross_product(X1,X2),X3) = intersection(X3,cross_product(X1,X2)),
inference(rw,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_35,plain,
( ~ member(X1,null_class)
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_19,c_0_30]) ).
cnf(c_0_36,plain,
( intersection(X1,X2) = null_class
| member(regular(intersection(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_18]) ).
cnf(c_0_37,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
c_0_32 ).
cnf(c_0_38,plain,
( intersection(cross_product(unordered_pair(X1,X1),universal_class),X2) != null_class
| ~ member(X1,domain_of(X2)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
intersection(X1,null_class) = null_class,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_24]) ).
cnf(c_0_40,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_37,c_0_18]) ).
cnf(c_0_41,plain,
~ member(X1,domain_of(null_class)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_43,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
regularity2 ).
cnf(c_0_44,plain,
( regular(unordered_pair(X1,X1)) = X1
| unordered_pair(X1,X1) = null_class ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_40])]) ).
cnf(c_0_45,plain,
domain_of(null_class) = null_class,
inference(spm,[status(thm)],[c_0_41,c_0_18]) ).
cnf(c_0_46,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
c_0_42 ).
cnf(c_0_47,plain,
( intersection(unordered_pair(X1,X1),X1) = null_class
| unordered_pair(X1,X1) = null_class ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
~ member(X1,null_class),
inference(rw,[status(thm)],[c_0_41,c_0_45]) ).
cnf(c_0_49,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[unordered_pair2]) ).
cnf(c_0_50,negated_conjecture,
unordered_pair(singleton(x),unordered_pair(x,null_class)) != ordered_pair(x,universal_class),
inference(fof_simplification,[status(thm)],[prove_corollary_1_to_property_1_of_ordered_pair_1]) ).
cnf(c_0_51,axiom,
unordered_pair(singleton(X1),unordered_pair(X1,singleton(X2))) = ordered_pair(X1,X2),
ordered_pair ).
cnf(c_0_52,plain,
( unordered_pair(X1,X1) = null_class
| ~ member(X2,unordered_pair(X1,X1))
| ~ member(X2,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_53,plain,
( member(X1,unordered_pair(X1,X2))
| ~ member(X1,universal_class) ),
c_0_49 ).
cnf(c_0_54,plain,
( unordered_pair(X1,X1) = null_class
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_24,c_0_44]) ).
cnf(c_0_55,negated_conjecture,
unordered_pair(singleton(x),unordered_pair(x,null_class)) != ordered_pair(x,universal_class),
c_0_50 ).
cnf(c_0_56,plain,
unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,unordered_pair(X2,X2))) = ordered_pair(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_27]),c_0_27]) ).
cnf(c_0_57,plain,
( unordered_pair(X1,X1) = null_class
| ~ member(X1,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
cnf(c_0_58,negated_conjecture,
unordered_pair(unordered_pair(x,x),unordered_pair(x,null_class)) != unordered_pair(unordered_pair(x,x),unordered_pair(x,unordered_pair(universal_class,universal_class))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_27]),c_0_56]) ).
cnf(c_0_59,plain,
unordered_pair(universal_class,universal_class) = null_class,
inference(spm,[status(thm)],[c_0_57,c_0_54]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_58,c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET511-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 12:48:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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
% 0.20/0.58 # Version: 3.1.0
% 0.20/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.58 # Starting sh5l with 300s (1) cores
% 0.20/0.58 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 5051 completed with status 0
% 0.20/0.58 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.58 # No SInE strategy applied
% 0.20/0.58 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.20/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.20/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.58 # Starting new_bool_1 with 308s (1) cores
% 0.20/0.58 # Starting sh5l with 304s (1) cores
% 0.20/0.58 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.20/0.58 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 5058 completed with status 0
% 0.20/0.58 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.58 # No SInE strategy applied
% 0.20/0.58 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.20/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.20/0.58 # Preprocessing time : 0.003 s
% 0.20/0.58 # Presaturation interreduction done
% 0.20/0.58
% 0.20/0.58 # Proof found!
% 0.20/0.58 # SZS status Unsatisfiable
% 0.20/0.58 # SZS output start CNFRefutation
% See solution above
% 0.20/0.58 # Parsed axioms : 113
% 0.20/0.58 # Removed by relevancy pruning/SinE : 0
% 0.20/0.58 # Initial clauses : 113
% 0.20/0.58 # Removed in clause preprocessing : 17
% 0.20/0.58 # Initial clauses in saturation : 96
% 0.20/0.58 # Processed clauses : 615
% 0.20/0.58 # ...of these trivial : 1
% 0.20/0.58 # ...subsumed : 148
% 0.20/0.58 # ...remaining for further processing : 466
% 0.20/0.58 # Other redundant clauses eliminated : 6
% 0.20/0.58 # Clauses deleted for lack of memory : 0
% 0.20/0.58 # Backward-subsumed : 38
% 0.20/0.58 # Backward-rewritten : 15
% 0.20/0.58 # Generated clauses : 1272
% 0.20/0.58 # ...of the previous two non-redundant : 1085
% 0.20/0.58 # ...aggressively subsumed : 0
% 0.20/0.58 # Contextual simplify-reflections : 6
% 0.20/0.58 # Paramodulations : 1258
% 0.20/0.58 # Factorizations : 4
% 0.20/0.58 # NegExts : 0
% 0.20/0.58 # Equation resolutions : 6
% 0.20/0.58 # Disequality decompositions : 0
% 0.20/0.58 # Total rewrite steps : 337
% 0.20/0.58 # ...of those cached : 270
% 0.20/0.58 # Propositional unsat checks : 0
% 0.20/0.58 # Propositional check models : 0
% 0.20/0.58 # Propositional check unsatisfiable : 0
% 0.20/0.58 # Propositional clauses : 0
% 0.20/0.58 # Propositional clauses after purity: 0
% 0.20/0.58 # Propositional unsat core size : 0
% 0.20/0.58 # Propositional preprocessing time : 0.000
% 0.20/0.58 # Propositional encoding time : 0.000
% 0.20/0.58 # Propositional solver time : 0.000
% 0.20/0.58 # Success case prop preproc time : 0.000
% 0.20/0.58 # Success case prop encoding time : 0.000
% 0.20/0.58 # Success case prop solver time : 0.000
% 0.20/0.58 # Current number of processed clauses : 310
% 0.20/0.58 # Positive orientable unit clauses : 44
% 0.20/0.58 # Positive unorientable unit clauses: 1
% 0.20/0.58 # Negative unit clauses : 7
% 0.20/0.58 # Non-unit-clauses : 258
% 0.20/0.58 # Current number of unprocessed clauses: 547
% 0.20/0.58 # ...number of literals in the above : 1666
% 0.20/0.58 # Current number of archived formulas : 0
% 0.20/0.58 # Current number of archived clauses : 169
% 0.20/0.58 # Clause-clause subsumption calls (NU) : 21191
% 0.20/0.58 # Rec. Clause-clause subsumption calls : 9403
% 0.20/0.58 # Non-unit clause-clause subsumptions : 147
% 0.20/0.58 # Unit Clause-clause subsumption calls : 1432
% 0.20/0.58 # Rewrite failures with RHS unbound : 0
% 0.20/0.58 # BW rewrite match attempts : 32
% 0.20/0.58 # BW rewrite match successes : 14
% 0.20/0.58 # Condensation attempts : 0
% 0.20/0.58 # Condensation successes : 0
% 0.20/0.58 # Termbank termtop insertions : 45430
% 0.20/0.58 # Search garbage collected termcells : 185
% 0.20/0.58
% 0.20/0.58 # -------------------------------------------------
% 0.20/0.58 # User time : 0.072 s
% 0.20/0.58 # System time : 0.005 s
% 0.20/0.58 # Total time : 0.077 s
% 0.20/0.58 # Maximum resident set size: 2004 pages
% 0.20/0.58
% 0.20/0.58 # -------------------------------------------------
% 0.20/0.58 # User time : 0.291 s
% 0.20/0.58 # System time : 0.019 s
% 0.20/0.58 # Total time : 0.310 s
% 0.20/0.58 # Maximum resident set size: 1796 pages
% 0.20/0.58 % E---3.1 exiting
% 0.87/0.58 % E exiting
%------------------------------------------------------------------------------