TSTP Solution File: SET191-6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET191-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:53:35 EDT 2024
% Result : Unsatisfiable 0.69s 0.58s
% Output : CNFRefutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of clauses : 45 ( 16 unt; 9 nHn; 33 RR)
% Number of literals : 84 ( 13 equ; 40 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 : 60 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(complement1,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(prove_subclass_property8_1,negated_conjecture,
union(complement(x),y) = universal_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_subclass_property8_1) ).
cnf(union,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',union) ).
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(regularity1,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',regularity1) ).
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(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_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(prove_subclass_property8_2,negated_conjecture,
~ subclass(x,y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_subclass_property8_2) ).
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(c_0_11,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_12,negated_conjecture,
union(complement(x),y) = universal_class,
prove_subclass_property8_1 ).
cnf(c_0_13,axiom,
complement(intersection(complement(X1),complement(X2))) = union(X1,X2),
union ).
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) ),
c_0_11 ).
cnf(c_0_16,negated_conjecture,
complement(intersection(complement(complement(x)),complement(y))) = universal_class,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
c_0_14 ).
cnf(c_0_18,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_19,negated_conjecture,
( ~ member(X1,intersection(complement(complement(x)),complement(y)))
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,axiom,
( X1 = null_class
| member(regular(X1),X1) ),
regularity1 ).
cnf(c_0_21,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( intersection(complement(complement(x)),complement(y)) = null_class
| ~ member(regular(intersection(complement(complement(x)),complement(y))),universal_class) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( X1 = null_class
| member(regular(X1),universal_class) ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_24,plain,
( complement(X1) = null_class
| ~ member(regular(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
intersection(complement(complement(x)),complement(y)) = null_class,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(fof_simplification,[status(thm)],[intersection3]) ).
cnf(c_0_27,plain,
null_class = complement(universal_class),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
~ member(X1,null_class),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_25]),c_0_21]) ).
cnf(c_0_29,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
c_0_26 ).
cnf(c_0_30,negated_conjecture,
intersection(complement(complement(x)),complement(y)) = complement(universal_class),
inference(rw,[status(thm)],[c_0_25,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
~ member(X1,complement(universal_class)),
inference(rw,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_32,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_33,negated_conjecture,
( ~ member(X1,complement(complement(x)))
| ~ member(X1,complement(y)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_34,plain,
( member(X1,complement(X2))
| member(X1,X2)
| ~ member(X1,universal_class) ),
c_0_32 ).
cnf(c_0_35,negated_conjecture,
( member(X1,complement(x))
| ~ member(X1,complement(y)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_21]) ).
cnf(c_0_36,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_37,negated_conjecture,
( member(X1,complement(x))
| member(X1,y)
| ~ member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_35,c_0_34]) ).
cnf(c_0_38,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
c_0_36 ).
cnf(c_0_39,negated_conjecture,
( member(X1,y)
| ~ member(X1,x) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_37]),c_0_21]) ).
cnf(c_0_40,negated_conjecture,
~ subclass(x,y),
inference(fof_simplification,[status(thm)],[prove_subclass_property8_2]) ).
cnf(c_0_41,negated_conjecture,
( subclass(X1,y)
| ~ member(not_subclass_element(X1,y),x) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_43,negated_conjecture,
~ subclass(x,y),
c_0_40 ).
cnf(c_0_44,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SET191-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n005.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 13:05:23 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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.69/0.58 # Version: 3.1.0
% 0.69/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.69/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.69/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.69/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.69/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.69/0.58 # Starting sh5l with 300s (1) cores
% 0.69/0.58 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 30992 completed with status 0
% 0.69/0.58 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.69/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.69/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.69/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.69/0.58 # No SInE strategy applied
% 0.69/0.58 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.69/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.69/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.69/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.69/0.58 # Starting new_bool_1 with 308s (1) cores
% 0.69/0.58 # Starting sh5l with 304s (1) cores
% 0.69/0.58 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.69/0.58 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 31000 completed with status 0
% 0.69/0.58 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.69/0.58 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.69/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.69/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.69/0.58 # No SInE strategy applied
% 0.69/0.58 # Search class: FGHSM-FFLM31-DFFFFFNN
% 0.69/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.69/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 313s (1) cores
% 0.69/0.58 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.69/0.58 # Preprocessing time : 0.006 s
% 0.69/0.58 # Presaturation interreduction done
% 0.69/0.58
% 0.69/0.58 # Proof found!
% 0.69/0.58 # SZS status Unsatisfiable
% 0.69/0.58 # SZS output start CNFRefutation
% See solution above
% 0.69/0.58 # Parsed axioms : 114
% 0.69/0.58 # Removed by relevancy pruning/SinE : 0
% 0.69/0.58 # Initial clauses : 114
% 0.69/0.58 # Removed in clause preprocessing : 17
% 0.69/0.58 # Initial clauses in saturation : 97
% 0.69/0.58 # Processed clauses : 382
% 0.69/0.58 # ...of these trivial : 0
% 0.69/0.58 # ...subsumed : 65
% 0.69/0.58 # ...remaining for further processing : 317
% 0.69/0.58 # Other redundant clauses eliminated : 4
% 0.69/0.58 # Clauses deleted for lack of memory : 0
% 0.69/0.58 # Backward-subsumed : 3
% 0.69/0.58 # Backward-rewritten : 30
% 0.69/0.58 # Generated clauses : 488
% 0.69/0.58 # ...of the previous two non-redundant : 461
% 0.69/0.58 # ...aggressively subsumed : 0
% 0.69/0.58 # Contextual simplify-reflections : 5
% 0.69/0.58 # Paramodulations : 484
% 0.69/0.58 # Factorizations : 0
% 0.69/0.58 # NegExts : 0
% 0.69/0.58 # Equation resolutions : 4
% 0.69/0.58 # Disequality decompositions : 0
% 0.69/0.58 # Total rewrite steps : 74
% 0.69/0.58 # ...of those cached : 53
% 0.69/0.58 # Propositional unsat checks : 0
% 0.69/0.58 # Propositional check models : 0
% 0.69/0.58 # Propositional check unsatisfiable : 0
% 0.69/0.58 # Propositional clauses : 0
% 0.69/0.58 # Propositional clauses after purity: 0
% 0.69/0.58 # Propositional unsat core size : 0
% 0.69/0.58 # Propositional preprocessing time : 0.000
% 0.69/0.58 # Propositional encoding time : 0.000
% 0.69/0.58 # Propositional solver time : 0.000
% 0.69/0.58 # Success case prop preproc time : 0.000
% 0.69/0.58 # Success case prop encoding time : 0.000
% 0.69/0.58 # Success case prop solver time : 0.000
% 0.69/0.58 # Current number of processed clauses : 184
% 0.69/0.58 # Positive orientable unit clauses : 29
% 0.69/0.58 # Positive unorientable unit clauses: 1
% 0.69/0.58 # Negative unit clauses : 3
% 0.69/0.58 # Non-unit-clauses : 151
% 0.69/0.58 # Current number of unprocessed clauses: 252
% 0.69/0.58 # ...number of literals in the above : 750
% 0.69/0.58 # Current number of archived formulas : 0
% 0.69/0.58 # Current number of archived clauses : 146
% 0.69/0.58 # Clause-clause subsumption calls (NU) : 5769
% 0.69/0.58 # Rec. Clause-clause subsumption calls : 2906
% 0.69/0.58 # Non-unit clause-clause subsumptions : 47
% 0.69/0.58 # Unit Clause-clause subsumption calls : 173
% 0.69/0.58 # Rewrite failures with RHS unbound : 0
% 0.69/0.58 # BW rewrite match attempts : 14
% 0.69/0.58 # BW rewrite match successes : 7
% 0.69/0.58 # Condensation attempts : 0
% 0.69/0.58 # Condensation successes : 0
% 0.69/0.58 # Termbank termtop insertions : 21362
% 0.69/0.58 # Search garbage collected termcells : 185
% 0.69/0.58
% 0.69/0.58 # -------------------------------------------------
% 0.69/0.58 # User time : 0.041 s
% 0.69/0.58 # System time : 0.006 s
% 0.69/0.58 # Total time : 0.047 s
% 0.69/0.58 # Maximum resident set size: 2012 pages
% 0.69/0.58
% 0.69/0.58 # -------------------------------------------------
% 0.69/0.58 # User time : 0.155 s
% 0.69/0.58 # System time : 0.026 s
% 0.69/0.58 # Total time : 0.182 s
% 0.69/0.58 # Maximum resident set size: 1792 pages
% 0.69/0.58 % E---3.1 exiting
% 0.69/0.58 % E exiting
%------------------------------------------------------------------------------