TSTP Solution File: SET190-6 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET190-6 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 02:57:58 EDT 2024
% Result : Unsatisfiable 1.40s 0.72s
% Output : CNFRefutation 1.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of clauses : 59 ( 17 unt; 14 nHn; 38 RR)
% Number of literals : 110 ( 21 equ; 45 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 91 ( 9 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(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(not_subclass_members2,axiom,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
cnf(complement2,axiom,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(not_subclass_members1,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(prove_subclass_property7_1,negated_conjecture,
subclass(x,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_subclass_property7_1) ).
cnf(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
cnf(intersection2,axiom,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection2) ).
cnf(subclass_implies_equal,axiom,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
cnf(prove_subclass_property7_2,negated_conjecture,
union(complement(x),y) != universal_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_subclass_property7_2) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',union) ).
cnf(c_0_13,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_14,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
c_0_13 ).
cnf(c_0_15,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_16,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_17,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_18,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_20,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_21,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
c_0_16 ).
cnf(c_0_22,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
c_0_17 ).
cnf(c_0_23,plain,
( member(not_subclass_element(X1,X2),universal_class)
| subclass(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
c_0_20 ).
cnf(c_0_25,plain,
( member(not_subclass_element(X1,complement(X2)),X2)
| subclass(X1,complement(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_26,negated_conjecture,
subclass(x,y),
prove_subclass_property7_1 ).
cnf(c_0_27,plain,
( subclass(X1,complement(complement(X2)))
| ~ member(not_subclass_element(X1,complement(complement(X2))),X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( member(X1,y)
| ~ member(X1,x) ),
inference(spm,[status(thm)],[c_0_14,c_0_26]) ).
cnf(c_0_29,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_30,negated_conjecture,
( subclass(X1,complement(complement(y)))
| ~ member(not_subclass_element(X1,complement(complement(y))),x) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_29]) ).
cnf(c_0_32,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_18,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
subclass(x,complement(complement(y))),
inference(spm,[status(thm)],[c_0_30,c_0_19]) ).
cnf(c_0_34,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_35,plain,
null_class = complement(universal_class),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_37,plain,
( subclass(complement(X1),X2)
| ~ member(not_subclass_element(complement(X1),X2),X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_19]) ).
cnf(c_0_38,negated_conjecture,
( member(X1,complement(complement(y)))
| ~ member(X1,x) ),
inference(spm,[status(thm)],[c_0_14,c_0_33]) ).
cnf(c_0_39,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
c_0_34 ).
cnf(c_0_40,plain,
( X1 = complement(universal_class)
| member(regular(X1),X1) ),
inference(rw,[status(thm)],[c_0_29,c_0_35]) ).
cnf(c_0_41,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_42,negated_conjecture,
union(complement(x),y) != universal_class,
inference(fof_simplification,[status(thm)],[prove_subclass_property7_2]) ).
cnf(c_0_43,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
c_0_36 ).
cnf(c_0_44,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_27,c_0_19]) ).
cnf(c_0_45,plain,
( member(not_subclass_element(complement(complement(X1)),X2),X1)
| subclass(complement(complement(X1)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_22]),c_0_23]) ).
cnf(c_0_46,negated_conjecture,
( ~ member(X1,complement(y))
| ~ member(X1,x) ),
inference(spm,[status(thm)],[c_0_24,c_0_38]) ).
cnf(c_0_47,plain,
( intersection(X1,X2) = complement(universal_class)
| member(regular(intersection(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_48,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
c_0_41 ).
cnf(c_0_49,negated_conjecture,
union(complement(x),y) != universal_class,
c_0_42 ).
cnf(c_0_50,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
cnf(c_0_51,plain,
( complement(complement(X1)) = X1
| ~ subclass(complement(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_52,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_21,c_0_45]) ).
cnf(c_0_53,negated_conjecture,
( intersection(X1,complement(y)) = complement(universal_class)
| ~ member(regular(intersection(X1,complement(y))),x) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_54,plain,
( intersection(X1,X2) = complement(universal_class)
| member(regular(intersection(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_40]) ).
cnf(c_0_55,negated_conjecture,
complement(intersection(complement(complement(x)),complement(y))) != universal_class,
inference(rw,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_56,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]) ).
cnf(c_0_57,negated_conjecture,
intersection(x,complement(y)) = complement(universal_class),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET190-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 12:04:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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/benchmark/theBenchmark.p
% 1.40/0.72 # Version: 3.1.0
% 1.40/0.72 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.40/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.40/0.72 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.40/0.72 # Starting new_bool_3 with 300s (1) cores
% 1.40/0.72 # Starting new_bool_1 with 300s (1) cores
% 1.40/0.72 # Starting sh5l with 300s (1) cores
% 1.40/0.72 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 19666 completed with status 0
% 1.40/0.72 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.40/0.72 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.40/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.40/0.72 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.40/0.72 # No SInE strategy applied
% 1.40/0.72 # Search class: FGHSM-FFLM31-DFFFFFNN
% 1.40/0.72 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.40/0.72 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 1.40/0.72 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.40/0.72 # Starting new_bool_1 with 308s (1) cores
% 1.40/0.72 # Starting sh5l with 304s (1) cores
% 1.40/0.72 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.40/0.72 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 19674 completed with status 0
% 1.40/0.72 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.40/0.72 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.40/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.40/0.72 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.40/0.72 # No SInE strategy applied
% 1.40/0.72 # Search class: FGHSM-FFLM31-DFFFFFNN
% 1.40/0.72 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.40/0.72 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 1.40/0.72 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.40/0.72 # Preprocessing time : 0.004 s
% 1.40/0.72 # Presaturation interreduction done
% 1.40/0.72
% 1.40/0.72 # Proof found!
% 1.40/0.72 # SZS status Unsatisfiable
% 1.40/0.72 # SZS output start CNFRefutation
% See solution above
% 1.40/0.72 # Parsed axioms : 114
% 1.40/0.72 # Removed by relevancy pruning/SinE : 0
% 1.40/0.72 # Initial clauses : 114
% 1.40/0.72 # Removed in clause preprocessing : 17
% 1.40/0.72 # Initial clauses in saturation : 97
% 1.40/0.72 # Processed clauses : 1881
% 1.40/0.72 # ...of these trivial : 7
% 1.40/0.72 # ...subsumed : 1085
% 1.40/0.72 # ...remaining for further processing : 789
% 1.40/0.72 # Other redundant clauses eliminated : 10
% 1.40/0.72 # Clauses deleted for lack of memory : 0
% 1.40/0.72 # Backward-subsumed : 19
% 1.40/0.72 # Backward-rewritten : 138
% 1.40/0.72 # Generated clauses : 7127
% 1.40/0.72 # ...of the previous two non-redundant : 6311
% 1.40/0.72 # ...aggressively subsumed : 0
% 1.40/0.72 # Contextual simplify-reflections : 14
% 1.40/0.72 # Paramodulations : 7111
% 1.40/0.72 # Factorizations : 6
% 1.40/0.72 # NegExts : 0
% 1.40/0.72 # Equation resolutions : 10
% 1.40/0.72 # Disequality decompositions : 0
% 1.40/0.72 # Total rewrite steps : 2065
% 1.40/0.72 # ...of those cached : 1736
% 1.40/0.72 # Propositional unsat checks : 0
% 1.40/0.72 # Propositional check models : 0
% 1.40/0.72 # Propositional check unsatisfiable : 0
% 1.40/0.72 # Propositional clauses : 0
% 1.40/0.72 # Propositional clauses after purity: 0
% 1.40/0.72 # Propositional unsat core size : 0
% 1.40/0.72 # Propositional preprocessing time : 0.000
% 1.40/0.72 # Propositional encoding time : 0.000
% 1.40/0.72 # Propositional solver time : 0.000
% 1.40/0.72 # Success case prop preproc time : 0.000
% 1.40/0.72 # Success case prop encoding time : 0.000
% 1.40/0.72 # Success case prop solver time : 0.000
% 1.40/0.72 # Current number of processed clauses : 532
% 1.40/0.72 # Positive orientable unit clauses : 73
% 1.40/0.72 # Positive unorientable unit clauses: 1
% 1.40/0.72 # Negative unit clauses : 3
% 1.40/0.72 # Non-unit-clauses : 455
% 1.40/0.72 # Current number of unprocessed clauses: 4429
% 1.40/0.72 # ...number of literals in the above : 16111
% 1.40/0.72 # Current number of archived formulas : 0
% 1.40/0.72 # Current number of archived clauses : 270
% 1.40/0.72 # Clause-clause subsumption calls (NU) : 75328
% 1.40/0.72 # Rec. Clause-clause subsumption calls : 36939
% 1.40/0.72 # Non-unit clause-clause subsumptions : 953
% 1.40/0.72 # Unit Clause-clause subsumption calls : 3273
% 1.40/0.72 # Rewrite failures with RHS unbound : 0
% 1.40/0.72 # BW rewrite match attempts : 141
% 1.40/0.72 # BW rewrite match successes : 54
% 1.40/0.72 # Condensation attempts : 0
% 1.40/0.72 # Condensation successes : 0
% 1.40/0.72 # Termbank termtop insertions : 395358
% 1.40/0.72 # Search garbage collected termcells : 185
% 1.40/0.72
% 1.40/0.72 # -------------------------------------------------
% 1.40/0.72 # User time : 0.225 s
% 1.40/0.72 # System time : 0.011 s
% 1.40/0.72 # Total time : 0.236 s
% 1.40/0.72 # Maximum resident set size: 1984 pages
% 1.40/0.72
% 1.40/0.72 # -------------------------------------------------
% 1.40/0.72 # User time : 1.135 s
% 1.40/0.72 # System time : 0.036 s
% 1.40/0.72 # Total time : 1.172 s
% 1.40/0.72 # Maximum resident set size: 1796 pages
% 1.40/0.72 % E---3.1 exiting
%------------------------------------------------------------------------------