TSTP Solution File: SET553-6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET553-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:17 EDT 2024
% Result : Unsatisfiable 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 11 unt; 3 nHn; 10 RR)
% Number of literals : 29 ( 5 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-2 aty)
% Number of variables : 30 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(intersection1,axiom,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',intersection1) ).
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(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(cantor_class,axiom,
intersection(domain_of(X1),diagonalise(compose(inverse(element_relation),X1))) = cantor(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',cantor_class) ).
cnf(diagonalisation,axiom,
complement(domain_of(intersection(X1,identity_relation))) = diagonalise(X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET004-0.ax',diagonalisation) ).
cnf(prove_cantor_class_alternate_defn_1,negated_conjecture,
~ subclass(cantor(x),domain_of(x)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cantor_class_alternate_defn_1) ).
cnf(c_0_6,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(fof_simplification,[status(thm)],[intersection1]) ).
cnf(c_0_7,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_8,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
c_0_6 ).
cnf(c_0_9,axiom,
( member(not_subclass_element(X1,X2),X1)
| subclass(X1,X2) ),
not_subclass_members1 ).
cnf(c_0_10,plain,
( subclass(X1,X2)
| ~ member(not_subclass_element(X1,X2),X2) ),
c_0_7 ).
cnf(c_0_11,plain,
( member(not_subclass_element(intersection(X1,X2),X3),X1)
| subclass(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,axiom,
intersection(domain_of(X1),diagonalise(compose(inverse(element_relation),X1))) = cantor(X1),
cantor_class ).
cnf(c_0_13,axiom,
complement(domain_of(intersection(X1,identity_relation))) = diagonalise(X1),
diagonalisation ).
cnf(c_0_14,negated_conjecture,
~ subclass(cantor(x),domain_of(x)),
inference(fof_simplification,[status(thm)],[prove_cantor_class_alternate_defn_1]) ).
cnf(c_0_15,plain,
subclass(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
intersection(domain_of(X1),complement(domain_of(intersection(compose(inverse(element_relation),X1),identity_relation)))) = cantor(X1),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
~ subclass(cantor(x),domain_of(x)),
c_0_14 ).
cnf(c_0_18,plain,
subclass(cantor(X1),domain_of(X1)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET553-6 : TPTP v8.2.0. Bugfixed v2.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon May 20 11:37:53 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 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.19/0.51 # Version: 3.1.0
% 0.19/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # sh5l with pid 30689 completed with status 0
% 0.19/0.51 # Result found by sh5l
% 0.19/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.51 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.19/0.51 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.19/0.51 # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 30692 completed with status 0
% 0.19/0.51 # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 0.19/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.51 # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.19/0.51 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.51 # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.19/0.51 # Preprocessing time : 0.003 s
% 0.19/0.51 # Presaturation interreduction done
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Unsatisfiable
% 0.19/0.51 # SZS output start CNFRefutation
% See solution above
% 0.19/0.51 # Parsed axioms : 113
% 0.19/0.51 # Removed by relevancy pruning/SinE : 14
% 0.19/0.51 # Initial clauses : 99
% 0.19/0.51 # Removed in clause preprocessing : 0
% 0.19/0.51 # Initial clauses in saturation : 99
% 0.19/0.51 # Processed clauses : 349
% 0.19/0.51 # ...of these trivial : 6
% 0.19/0.51 # ...subsumed : 34
% 0.19/0.51 # ...remaining for further processing : 309
% 0.19/0.51 # Other redundant clauses eliminated : 2
% 0.19/0.51 # Clauses deleted for lack of memory : 0
% 0.19/0.51 # Backward-subsumed : 1
% 0.19/0.51 # Backward-rewritten : 14
% 0.19/0.51 # Generated clauses : 824
% 0.19/0.51 # ...of the previous two non-redundant : 738
% 0.19/0.51 # ...aggressively subsumed : 0
% 0.19/0.51 # Contextual simplify-reflections : 1
% 0.19/0.51 # Paramodulations : 820
% 0.19/0.51 # Factorizations : 0
% 0.19/0.51 # NegExts : 0
% 0.19/0.51 # Equation resolutions : 4
% 0.19/0.51 # Disequality decompositions : 0
% 0.19/0.51 # Total rewrite steps : 179
% 0.19/0.51 # ...of those cached : 101
% 0.19/0.51 # Propositional unsat checks : 0
% 0.19/0.51 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 194
% 0.19/0.51 # Positive orientable unit clauses : 68
% 0.19/0.51 # Positive unorientable unit clauses: 1
% 0.19/0.51 # Negative unit clauses : 1
% 0.19/0.51 # Non-unit-clauses : 124
% 0.19/0.51 # Current number of unprocessed clauses: 582
% 0.19/0.51 # ...number of literals in the above : 1245
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 113
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 3334
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 2953
% 0.19/0.51 # Non-unit clause-clause subsumptions : 23
% 0.19/0.51 # Unit Clause-clause subsumption calls : 785
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 51
% 0.19/0.51 # BW rewrite match successes : 15
% 0.19/0.51 # Condensation attempts : 0
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 14653
% 0.19/0.51 # Search garbage collected termcells : 229
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.032 s
% 0.19/0.51 # System time : 0.002 s
% 0.19/0.51 # Total time : 0.034 s
% 0.19/0.51 # Maximum resident set size: 1892 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.034 s
% 0.19/0.51 # System time : 0.006 s
% 0.19/0.51 # Total time : 0.040 s
% 0.19/0.51 # Maximum resident set size: 1796 pages
% 0.19/0.51 % E---3.1 exiting
% 0.19/0.51 % E exiting
%------------------------------------------------------------------------------