TSTP Solution File: SET098-7 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET098-7 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:36 EDT 2024
% Result : Unsatisfiable 0.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 18 unt; 6 nHn; 19 RR)
% Number of literals : 39 ( 19 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 21 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_corollary_1_to_number_of_elements_in_class_1,negated_conjecture,
~ member(not_subclass_element(intersection(complement(singleton(not_subclass_element(x,null_class))),x),null_class),x),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_1_to_number_of_elements_in_class_1) ).
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(null_class_is_unique,axiom,
( X1 = null_class
| member(not_subclass_element(X1,null_class),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',null_class_is_unique) ).
cnf(prove_corollary_1_to_number_of_elements_in_class_2,negated_conjecture,
singleton(not_subclass_element(x,null_class)) != x,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_1_to_number_of_elements_in_class_2) ).
cnf(number_of_elements_in_class,axiom,
( member(not_subclass_element(intersection(complement(singleton(not_subclass_element(X1,null_class))),X1),null_class),intersection(complement(singleton(not_subclass_element(X1,null_class))),X1))
| singleton(not_subclass_element(X1,null_class)) = X1
| X1 = null_class ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',number_of_elements_in_class) ).
cnf(prove_corollary_1_to_number_of_elements_in_class_3,negated_conjecture,
x != null_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_corollary_1_to_number_of_elements_in_class_3) ).
cnf(existence_of_null_class,axiom,
~ member(X1,null_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_of_null_class) ).
cnf(c_0_8,negated_conjecture,
~ member(not_subclass_element(intersection(complement(singleton(not_subclass_element(x,null_class))),x),null_class),x),
inference(fof_simplification,[status(thm)],[prove_corollary_1_to_number_of_elements_in_class_1]) ).
cnf(c_0_9,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection2]) ).
cnf(c_0_10,negated_conjecture,
~ member(not_subclass_element(intersection(complement(singleton(not_subclass_element(x,null_class))),x),null_class),x),
c_0_8 ).
cnf(c_0_11,axiom,
unordered_pair(X1,X1) = singleton(X1),
singleton_set ).
cnf(c_0_12,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
c_0_9 ).
cnf(c_0_13,axiom,
( X1 = null_class
| member(not_subclass_element(X1,null_class),X1) ),
null_class_is_unique ).
cnf(c_0_14,negated_conjecture,
singleton(not_subclass_element(x,null_class)) != x,
inference(fof_simplification,[status(thm)],[prove_corollary_1_to_number_of_elements_in_class_2]) ).
cnf(c_0_15,axiom,
( member(not_subclass_element(intersection(complement(singleton(not_subclass_element(X1,null_class))),X1),null_class),intersection(complement(singleton(not_subclass_element(X1,null_class))),X1))
| singleton(not_subclass_element(X1,null_class)) = X1
| X1 = null_class ),
number_of_elements_in_class ).
cnf(c_0_16,negated_conjecture,
~ member(not_subclass_element(intersection(complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))),x),null_class),x),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,plain,
( intersection(X1,X2) = null_class
| member(not_subclass_element(intersection(X1,X2),null_class),X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
singleton(not_subclass_element(x,null_class)) != x,
c_0_14 ).
cnf(c_0_19,negated_conjecture,
x != null_class,
inference(fof_simplification,[status(thm)],[prove_corollary_1_to_number_of_elements_in_class_3]) ).
cnf(c_0_20,plain,
~ member(X1,null_class),
inference(fof_simplification,[status(thm)],[existence_of_null_class]) ).
cnf(c_0_21,plain,
( unordered_pair(not_subclass_element(X1,null_class),not_subclass_element(X1,null_class)) = X1
| X1 = null_class
| member(not_subclass_element(intersection(complement(unordered_pair(not_subclass_element(X1,null_class),not_subclass_element(X1,null_class))),X1),null_class),intersection(complement(unordered_pair(not_subclass_element(X1,null_class),not_subclass_element(X1,null_class))),X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_11]),c_0_11]),c_0_11]) ).
cnf(c_0_22,negated_conjecture,
intersection(complement(unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class))),x) = null_class,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
unordered_pair(not_subclass_element(x,null_class),not_subclass_element(x,null_class)) != x,
inference(rw,[status(thm)],[c_0_18,c_0_11]) ).
cnf(c_0_24,negated_conjecture,
x != null_class,
c_0_19 ).
cnf(c_0_25,plain,
~ member(X1,null_class),
c_0_20 ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SET098-7 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.00/0.09 % Command : run_E %s %d THM
% 0.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Mon May 20 11:43:37 EDT 2024
% 0.08/0.28 % CPUTime :
% 0.13/0.36 Running first-order model finding
% 0.13/0.36 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
% 0.13/0.39 # Version: 3.1.0
% 0.13/0.39 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.39 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.39 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.39 # Starting sh5l with 300s (1) cores
% 0.13/0.39 # new_bool_3 with pid 12161 completed with status 0
% 0.13/0.39 # Result found by new_bool_3
% 0.13/0.39 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.39 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.39 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.39 # Search class: FGHSM-FFMF21-MFFFFFNN
% 0.13/0.39 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.39 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 181s (1) cores
% 0.13/0.39 # G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with pid 12165 completed with status 0
% 0.13/0.39 # Result found by G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN
% 0.13/0.39 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.39 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.39 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.39 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.39 # Search class: FGHSM-FFMF21-MFFFFFNN
% 0.13/0.39 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.39 # Starting G-E--_208_B00_00_F1_SE_CS_SP_PS_S5PRR_S00EN with 181s (1) cores
% 0.13/0.39 # Preprocessing time : 0.001 s
% 0.13/0.39 # Presaturation interreduction done
% 0.13/0.39
% 0.13/0.39 # Proof found!
% 0.13/0.39 # SZS status Unsatisfiable
% 0.13/0.39 # SZS output start CNFRefutation
% See solution above
% 0.13/0.39 # Parsed axioms : 144
% 0.13/0.39 # Removed by relevancy pruning/SinE : 79
% 0.13/0.39 # Initial clauses : 65
% 0.13/0.39 # Removed in clause preprocessing : 0
% 0.13/0.39 # Initial clauses in saturation : 65
% 0.13/0.39 # Processed clauses : 377
% 0.13/0.39 # ...of these trivial : 11
% 0.13/0.39 # ...subsumed : 153
% 0.13/0.39 # ...remaining for further processing : 213
% 0.13/0.39 # Other redundant clauses eliminated : 6
% 0.13/0.39 # Clauses deleted for lack of memory : 0
% 0.13/0.39 # Backward-subsumed : 4
% 0.13/0.39 # Backward-rewritten : 12
% 0.13/0.39 # Generated clauses : 1169
% 0.13/0.39 # ...of the previous two non-redundant : 925
% 0.13/0.39 # ...aggressively subsumed : 0
% 0.13/0.39 # Contextual simplify-reflections : 0
% 0.13/0.39 # Paramodulations : 1138
% 0.13/0.39 # Factorizations : 24
% 0.13/0.39 # NegExts : 0
% 0.13/0.39 # Equation resolutions : 7
% 0.13/0.39 # Disequality decompositions : 0
% 0.13/0.39 # Total rewrite steps : 287
% 0.13/0.39 # ...of those cached : 225
% 0.13/0.39 # Propositional unsat checks : 0
% 0.13/0.39 # Propositional check models : 0
% 0.13/0.39 # Propositional check unsatisfiable : 0
% 0.13/0.39 # Propositional clauses : 0
% 0.13/0.39 # Propositional clauses after purity: 0
% 0.13/0.39 # Propositional unsat core size : 0
% 0.13/0.39 # Propositional preprocessing time : 0.000
% 0.13/0.39 # Propositional encoding time : 0.000
% 0.13/0.39 # Propositional solver time : 0.000
% 0.13/0.39 # Success case prop preproc time : 0.000
% 0.13/0.39 # Success case prop encoding time : 0.000
% 0.13/0.39 # Success case prop solver time : 0.000
% 0.13/0.39 # Current number of processed clauses : 137
% 0.13/0.39 # Positive orientable unit clauses : 27
% 0.13/0.39 # Positive unorientable unit clauses: 1
% 0.13/0.39 # Negative unit clauses : 20
% 0.13/0.39 # Non-unit-clauses : 89
% 0.13/0.39 # Current number of unprocessed clauses: 667
% 0.13/0.39 # ...number of literals in the above : 1809
% 0.13/0.39 # Current number of archived formulas : 0
% 0.13/0.39 # Current number of archived clauses : 74
% 0.13/0.39 # Clause-clause subsumption calls (NU) : 1185
% 0.13/0.39 # Rec. Clause-clause subsumption calls : 1136
% 0.13/0.39 # Non-unit clause-clause subsumptions : 90
% 0.13/0.39 # Unit Clause-clause subsumption calls : 55
% 0.13/0.39 # Rewrite failures with RHS unbound : 0
% 0.13/0.39 # BW rewrite match attempts : 48
% 0.13/0.39 # BW rewrite match successes : 32
% 0.13/0.39 # Condensation attempts : 0
% 0.13/0.39 # Condensation successes : 0
% 0.13/0.39 # Termbank termtop insertions : 15668
% 0.13/0.39 # Search garbage collected termcells : 476
% 0.13/0.39
% 0.13/0.39 # -------------------------------------------------
% 0.13/0.39 # User time : 0.014 s
% 0.13/0.39 # System time : 0.005 s
% 0.13/0.39 # Total time : 0.019 s
% 0.13/0.39 # Maximum resident set size: 1860 pages
% 0.13/0.39
% 0.13/0.39 # -------------------------------------------------
% 0.13/0.39 # User time : 0.015 s
% 0.13/0.39 # System time : 0.008 s
% 0.13/0.39 # Total time : 0.023 s
% 0.13/0.39 # Maximum resident set size: 1812 pages
% 0.13/0.39 % E---3.1 exiting
%------------------------------------------------------------------------------