TSTP Solution File: SET129-6 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET129-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:22:19 EDT 2024
% Result : Unsatisfiable 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 15
% Syntax : Number of clauses : 65 ( 26 unt; 16 nHn; 48 RR)
% Number of literals : 132 ( 29 equ; 67 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 73 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(definition_of_set_builder,axiom,
union(singleton(X1),X2) = set_builder(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.BTnJAMgyWz/E---3.1_4890.p',definition_of_set_builder) ).
cnf(singleton_set,axiom,
unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/tmp/tmp.BTnJAMgyWz/E---3.1_4890.p',singleton_set) ).
cnf(subclass_members,axiom,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
file('/export/starexec/sandbox/tmp/tmp.BTnJAMgyWz/E---3.1_4890.p',subclass_members) ).
cnf(prove_members_of_built_triple_1,negated_conjecture,
member(u,set_builder(x,set_builder(y,set_builder(z,null_class)))),
file('/export/starexec/sandbox/tmp/tmp.BTnJAMgyWz/E---3.1_4890.p',prove_members_of_built_triple_1) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.BTnJAMgyWz/E---3.1_4890.p',union) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.BTnJAMgyWz/E---3.1_4890.p',complement1) ).
cnf(intersection3,axiom,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.BTnJAMgyWz/E---3.1_4890.p',intersection3) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox/tmp/tmp.BTnJAMgyWz/E---3.1_4890.p',complement2) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/tmp/tmp.BTnJAMgyWz/E---3.1_4890.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.BTnJAMgyWz/E---3.1_4890.p',unordered_pair_member) ).
cnf(prove_members_of_built_triple_4,negated_conjecture,
u != z,
file('/export/starexec/sandbox/tmp/tmp.BTnJAMgyWz/E---3.1_4890.p',prove_members_of_built_triple_4) ).
cnf(prove_members_of_built_triple_3,negated_conjecture,
u != y,
file('/export/starexec/sandbox/tmp/tmp.BTnJAMgyWz/E---3.1_4890.p',prove_members_of_built_triple_3) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/tmp/tmp.BTnJAMgyWz/E---3.1_4890.p',intersection1) ).
cnf(prove_members_of_built_triple_2,negated_conjecture,
u != x,
file('/export/starexec/sandbox/tmp/tmp.BTnJAMgyWz/E---3.1_4890.p',prove_members_of_built_triple_2) ).
cnf(regularity2,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
file('/export/starexec/sandbox/tmp/tmp.BTnJAMgyWz/E---3.1_4890.p',regularity2) ).
cnf(c_0_15,axiom,
union(singleton(X1),X2) = set_builder(X1,X2),
definition_of_set_builder ).
cnf(c_0_16,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_17,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_18,negated_conjecture,
member(u,set_builder(x,set_builder(y,set_builder(z,null_class)))),
prove_members_of_built_triple_1 ).
cnf(c_0_19,plain,
union(unordered_pair(X1,X1),X2) = set_builder(X1,X2),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_21,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_22,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
c_0_17 ).
cnf(c_0_23,negated_conjecture,
member(u,complement(intersection(complement(unordered_pair(x,x)),complement(complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class)))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_19]),c_0_19]),c_0_20]),c_0_20]),c_0_20]) ).
cnf(c_0_24,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
c_0_21 ).
cnf(c_0_25,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_26,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_27,negated_conjecture,
( member(u,X1)
| ~ subclass(complement(intersection(complement(unordered_pair(x,x)),complement(complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class))))))))),X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_29,negated_conjecture,
~ member(u,intersection(complement(unordered_pair(x,x)),complement(complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class))))))))),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_30,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
c_0_25 ).
cnf(c_0_31,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
c_0_26 ).
cnf(c_0_32,negated_conjecture,
member(u,universal_class),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( ~ member(u,complement(complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class))))))))
| ~ member(u,complement(unordered_pair(x,x))) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( member(u,complement(X1))
| member(u,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( member(u,complement(intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class)))))))
| ~ member(u,complement(unordered_pair(x,x))) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,negated_conjecture,
( ~ member(u,intersection(complement(unordered_pair(y,y)),complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class))))))
| ~ member(u,complement(unordered_pair(x,x))) ),
inference(spm,[status(thm)],[c_0_24,c_0_35]) ).
cnf(c_0_37,negated_conjecture,
( ~ member(u,complement(complement(intersection(complement(unordered_pair(z,z)),complement(null_class)))))
| ~ member(u,complement(unordered_pair(x,x)))
| ~ member(u,complement(unordered_pair(y,y))) ),
inference(spm,[status(thm)],[c_0_36,c_0_30]) ).
cnf(c_0_38,negated_conjecture,
( member(u,complement(intersection(complement(unordered_pair(z,z)),complement(null_class))))
| ~ member(u,complement(unordered_pair(x,x)))
| ~ member(u,complement(unordered_pair(y,y))) ),
inference(spm,[status(thm)],[c_0_37,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( ~ member(u,intersection(complement(unordered_pair(z,z)),complement(null_class)))
| ~ member(u,complement(unordered_pair(x,x)))
| ~ member(u,complement(unordered_pair(y,y))) ),
inference(spm,[status(thm)],[c_0_24,c_0_38]) ).
cnf(c_0_40,negated_conjecture,
( ~ member(u,complement(unordered_pair(x,x)))
| ~ member(u,complement(unordered_pair(y,y)))
| ~ member(u,complement(unordered_pair(z,z)))
| ~ member(u,complement(null_class)) ),
inference(spm,[status(thm)],[c_0_39,c_0_30]) ).
cnf(c_0_41,negated_conjecture,
( member(u,unordered_pair(z,z))
| ~ member(u,complement(unordered_pair(x,x)))
| ~ member(u,complement(unordered_pair(y,y)))
| ~ member(u,complement(null_class)) ),
inference(spm,[status(thm)],[c_0_40,c_0_34]) ).
cnf(c_0_42,negated_conjecture,
( member(u,unordered_pair(y,y))
| member(u,unordered_pair(z,z))
| ~ member(u,complement(unordered_pair(x,x)))
| ~ member(u,complement(null_class)) ),
inference(spm,[status(thm)],[c_0_41,c_0_34]) ).
cnf(c_0_43,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
inference(fof_simplification,[status(thm)],[unordered_pair_member]) ).
cnf(c_0_44,negated_conjecture,
( member(u,unordered_pair(z,z))
| member(u,unordered_pair(y,y))
| member(u,null_class)
| ~ member(u,complement(unordered_pair(x,x))) ),
inference(spm,[status(thm)],[c_0_42,c_0_34]) ).
cnf(c_0_45,negated_conjecture,
u != z,
inference(fof_simplification,[status(thm)],[prove_members_of_built_triple_4]) ).
cnf(c_0_46,plain,
( X1 = X2
| X1 = X3
| ~ member(X1,unordered_pair(X2,X3)) ),
c_0_43 ).
cnf(c_0_47,negated_conjecture,
( member(u,unordered_pair(x,x))
| member(u,unordered_pair(y,y))
| member(u,unordered_pair(z,z))
| member(u,null_class) ),
inference(spm,[status(thm)],[c_0_44,c_0_34]) ).
cnf(c_0_48,negated_conjecture,
u != z,
c_0_45 ).
cnf(c_0_49,negated_conjecture,
u != y,
inference(fof_simplification,[status(thm)],[prove_members_of_built_triple_3]) ).
cnf(c_0_50,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_51,negated_conjecture,
( member(u,unordered_pair(y,y))
| member(u,unordered_pair(x,x))
| member(u,null_class) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_52,negated_conjecture,
u != y,
c_0_49 ).
cnf(c_0_53,negated_conjecture,
u != x,
inference(fof_simplification,[status(thm)],[prove_members_of_built_triple_2]) ).
cnf(c_0_54,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
c_0_50 ).
cnf(c_0_55,axiom,
( X1 = null_class
| intersection(X1,regular(X1)) = null_class ),
regularity2 ).
cnf(c_0_56,negated_conjecture,
( member(u,unordered_pair(x,x))
| member(u,null_class) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_51]),c_0_52]) ).
cnf(c_0_57,negated_conjecture,
u != x,
c_0_53 ).
cnf(c_0_58,plain,
( X1 = null_class
| member(X2,X1)
| ~ member(X2,null_class) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,negated_conjecture,
member(u,null_class),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_56]),c_0_57]) ).
cnf(c_0_60,negated_conjecture,
( X1 = null_class
| member(u,X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_61,negated_conjecture,
( complement(X1) = null_class
| ~ member(u,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_60]) ).
cnf(c_0_62,negated_conjecture,
( ~ member(X1,null_class)
| ~ member(u,X2)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_61]) ).
cnf(c_0_63,negated_conjecture,
~ member(u,X1),
inference(spm,[status(thm)],[c_0_62,c_0_59]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_34,c_0_63]),c_0_63]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET129-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n020.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 10:23:16 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order model finding
% 0.21/0.49 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.BTnJAMgyWz/E---3.1_4890.p
% 0.21/0.53 # Version: 3.1.0
% 0.21/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 5005 completed with status 0
% 0.21/0.53 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.21/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 308s (1) cores
% 0.21/0.53 # Starting sh5l with 304s (1) cores
% 0.21/0.53 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.21/0.53 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 5016 completed with status 0
% 0.21/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.53 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.21/0.53 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.21/0.53 # Preprocessing time : 0.003 s
% 0.21/0.53 # Presaturation interreduction done
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Unsatisfiable
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 96
% 0.21/0.53 # Removed by relevancy pruning/SinE : 0
% 0.21/0.53 # Initial clauses : 96
% 0.21/0.53 # Removed in clause preprocessing : 16
% 0.21/0.53 # Initial clauses in saturation : 80
% 0.21/0.53 # Processed clauses : 196
% 0.21/0.53 # ...of these trivial : 0
% 0.21/0.53 # ...subsumed : 4
% 0.21/0.53 # ...remaining for further processing : 192
% 0.21/0.53 # Other redundant clauses eliminated : 3
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 14
% 0.21/0.53 # Backward-rewritten : 2
% 0.21/0.53 # Generated clauses : 244
% 0.21/0.53 # ...of the previous two non-redundant : 210
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 0
% 0.21/0.53 # Paramodulations : 236
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 3
% 0.21/0.53 # Disequality decompositions : 0
% 0.21/0.53 # Total rewrite steps : 34
% 0.21/0.53 # ...of those cached : 25
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 89
% 0.21/0.53 # Positive orientable unit clauses : 18
% 0.21/0.53 # Positive unorientable unit clauses: 1
% 0.21/0.53 # Negative unit clauses : 4
% 0.21/0.53 # Non-unit-clauses : 66
% 0.21/0.53 # Current number of unprocessed clauses: 173
% 0.21/0.53 # ...number of literals in the above : 467
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 116
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 2916
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 1299
% 0.21/0.53 # Non-unit clause-clause subsumptions : 6
% 0.21/0.53 # Unit Clause-clause subsumption calls : 176
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 6
% 0.21/0.53 # BW rewrite match successes : 3
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 9793
% 0.21/0.53 # Search garbage collected termcells : 160
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.021 s
% 0.21/0.53 # System time : 0.006 s
% 0.21/0.53 # Total time : 0.027 s
% 0.21/0.53 # Maximum resident set size: 1984 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.101 s
% 0.21/0.53 # System time : 0.019 s
% 0.21/0.53 # Total time : 0.119 s
% 0.21/0.53 # Maximum resident set size: 1772 pages
% 0.21/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------