TSTP Solution File: SET065+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET065+1 : TPTP v8.2.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:19 EDT 2024
% Result : Theorem 0.22s 0.49s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 10 unt; 0 def)
% Number of atoms : 45 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 41 ( 15 ~; 13 |; 9 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 22 ( 2 sgn 14 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(subclass_defn,axiom,
! [X1,X2] :
( subclass(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',subclass_defn) ).
fof(class_elements_are_sets,axiom,
! [X1] : subclass(X1,universal_class),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',class_elements_are_sets) ).
fof(inductive_defn,axiom,
! [X1] :
( inductive(X1)
<=> ( member(null_class,X1)
& subclass(image(successor_relation,X1),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',inductive_defn) ).
fof(infinity,axiom,
? [X1] :
( member(X1,universal_class)
& inductive(X1)
& ! [X2] :
( inductive(X2)
=> subclass(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET005+0.ax',infinity) ).
fof(null_class_is_a_set,conjecture,
member(null_class,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',null_class_is_a_set) ).
fof(c_0_5,plain,
! [X10,X11,X12,X13,X14] :
( ( ~ subclass(X10,X11)
| ~ member(X12,X10)
| member(X12,X11) )
& ( member(esk1_2(X13,X14),X13)
| subclass(X13,X14) )
& ( ~ member(esk1_2(X13,X14),X14)
| subclass(X13,X14) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[subclass_defn])])])])])])]) ).
fof(c_0_6,plain,
! [X21] : subclass(X21,universal_class),
inference(variable_rename,[status(thm)],[class_elements_are_sets]) ).
fof(c_0_7,plain,
! [X24] :
( ( member(null_class,X24)
| ~ inductive(X24) )
& ( subclass(image(successor_relation,X24),X24)
| ~ inductive(X24) )
& ( ~ member(null_class,X24)
| ~ subclass(image(successor_relation,X24),X24)
| inductive(X24) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inductive_defn])])])]) ).
fof(c_0_8,plain,
! [X75] :
( member(esk5_0,universal_class)
& inductive(esk5_0)
& ( ~ inductive(X75)
| subclass(esk5_0,X75) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[infinity])])])])]) ).
fof(c_0_9,negated_conjecture,
~ member(null_class,universal_class),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[null_class_is_a_set])]) ).
cnf(c_0_10,plain,
( member(X3,X2)
| ~ subclass(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
subclass(X1,universal_class),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( member(null_class,X1)
| ~ inductive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
inductive(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,negated_conjecture,
~ member(null_class,universal_class),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( member(X1,universal_class)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
member(null_class,esk5_0),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
~ member(null_class,universal_class),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET065+1 : TPTP v8.2.0. Bugfixed v5.4.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n029.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.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 12:57:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.47 Running first-order model finding
% 0.22/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
% 0.22/0.49 # Version: 3.1.0
% 0.22/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.49 # Starting sh5l with 300s (1) cores
% 0.22/0.49 # sh5l with pid 14512 completed with status 0
% 0.22/0.49 # Result found by sh5l
% 0.22/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.49 # Starting sh5l with 300s (1) cores
% 0.22/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.49 # Search class: FGHSM-FFMS31-MFFFFFNN
% 0.22/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.49 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 130s (1) cores
% 0.22/0.49 # G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 14519 completed with status 0
% 0.22/0.49 # Result found by G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 0.22/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.49 # Starting sh5l with 300s (1) cores
% 0.22/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.49 # Search class: FGHSM-FFMS31-MFFFFFNN
% 0.22/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.49 # Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 130s (1) cores
% 0.22/0.49 # Preprocessing time : 0.002 s
% 0.22/0.49
% 0.22/0.49 # Proof found!
% 0.22/0.49 # SZS status Theorem
% 0.22/0.49 # SZS output start CNFRefutation
% See solution above
% 0.22/0.49 # Parsed axioms : 44
% 0.22/0.49 # Removed by relevancy pruning/SinE : 3
% 0.22/0.49 # Initial clauses : 83
% 0.22/0.49 # Removed in clause preprocessing : 0
% 0.22/0.49 # Initial clauses in saturation : 83
% 0.22/0.49 # Processed clauses : 104
% 0.22/0.49 # ...of these trivial : 2
% 0.22/0.49 # ...subsumed : 6
% 0.22/0.49 # ...remaining for further processing : 96
% 0.22/0.49 # Other redundant clauses eliminated : 5
% 0.22/0.49 # Clauses deleted for lack of memory : 0
% 0.22/0.49 # Backward-subsumed : 2
% 0.22/0.49 # Backward-rewritten : 1
% 0.22/0.49 # Generated clauses : 208
% 0.22/0.49 # ...of the previous two non-redundant : 184
% 0.22/0.49 # ...aggressively subsumed : 0
% 0.22/0.49 # Contextual simplify-reflections : 0
% 0.22/0.49 # Paramodulations : 201
% 0.22/0.49 # Factorizations : 0
% 0.22/0.49 # NegExts : 0
% 0.22/0.49 # Equation resolutions : 7
% 0.22/0.49 # Disequality decompositions : 0
% 0.22/0.49 # Total rewrite steps : 9
% 0.22/0.49 # ...of those cached : 3
% 0.22/0.49 # Propositional unsat checks : 0
% 0.22/0.49 # Propositional check models : 0
% 0.22/0.49 # Propositional check unsatisfiable : 0
% 0.22/0.49 # Propositional clauses : 0
% 0.22/0.49 # Propositional clauses after purity: 0
% 0.22/0.49 # Propositional unsat core size : 0
% 0.22/0.49 # Propositional preprocessing time : 0.000
% 0.22/0.49 # Propositional encoding time : 0.000
% 0.22/0.49 # Propositional solver time : 0.000
% 0.22/0.49 # Success case prop preproc time : 0.000
% 0.22/0.49 # Success case prop encoding time : 0.000
% 0.22/0.49 # Success case prop solver time : 0.000
% 0.22/0.49 # Current number of processed clauses : 89
% 0.22/0.49 # Positive orientable unit clauses : 24
% 0.22/0.49 # Positive unorientable unit clauses: 0
% 0.22/0.49 # Negative unit clauses : 2
% 0.22/0.49 # Non-unit-clauses : 63
% 0.22/0.49 # Current number of unprocessed clauses: 162
% 0.22/0.49 # ...number of literals in the above : 405
% 0.22/0.49 # Current number of archived formulas : 0
% 0.22/0.49 # Current number of archived clauses : 3
% 0.22/0.49 # Clause-clause subsumption calls (NU) : 591
% 0.22/0.49 # Rec. Clause-clause subsumption calls : 526
% 0.22/0.49 # Non-unit clause-clause subsumptions : 4
% 0.22/0.49 # Unit Clause-clause subsumption calls : 49
% 0.22/0.49 # Rewrite failures with RHS unbound : 0
% 0.22/0.49 # BW rewrite match attempts : 15
% 0.22/0.49 # BW rewrite match successes : 1
% 0.22/0.49 # Condensation attempts : 0
% 0.22/0.49 # Condensation successes : 0
% 0.22/0.49 # Termbank termtop insertions : 7086
% 0.22/0.49 # Search garbage collected termcells : 904
% 0.22/0.49
% 0.22/0.49 # -------------------------------------------------
% 0.22/0.49 # User time : 0.013 s
% 0.22/0.49 # System time : 0.002 s
% 0.22/0.49 # Total time : 0.015 s
% 0.22/0.49 # Maximum resident set size: 2012 pages
% 0.22/0.49
% 0.22/0.49 # -------------------------------------------------
% 0.22/0.49 # User time : 0.015 s
% 0.22/0.49 # System time : 0.004 s
% 0.22/0.49 # Total time : 0.019 s
% 0.22/0.49 # Maximum resident set size: 1752 pages
% 0.22/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------