TSTP Solution File: SET091+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET091+1 : TPTP v8.2.0. Bugfixed v7.3.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:31 EDT 2024
% Result : Theorem 0.15s 0.40s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 15 ( 4 unt; 0 def)
% Number of atoms : 32 ( 24 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 28 ( 11 ~; 9 |; 6 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 15 ( 0 sgn 9 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(member_when_not_a_singleton,conjecture,
! [X1,X3] :
( ( ~ ? [X2] :
( member(X2,universal_class)
& X1 = singleton(X2) )
& X1 = X3 )
=> member_of(X1) = X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',member_when_not_a_singleton) ).
fof(member_universal_self,axiom,
! [X1] :
( member(member_of(X1),universal_class)
| member_of(X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',member_universal_self) ).
fof(singleton_self,axiom,
! [X1] :
( singleton(member_of(X1)) = X1
| member_of(X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_self) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X3] :
( ( ~ ? [X2] :
( member(X2,universal_class)
& X1 = singleton(X2) )
& X1 = X3 )
=> member_of(X1) = X3 ),
inference(assume_negation,[status(cth)],[member_when_not_a_singleton]) ).
fof(c_0_4,negated_conjecture,
! [X12] :
( ( ~ member(X12,universal_class)
| esk1_0 != singleton(X12) )
& esk1_0 = esk2_0
& member_of(esk1_0) != esk2_0 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
fof(c_0_5,plain,
! [X15] :
( member(member_of(X15),universal_class)
| member_of(X15) = X15 ),
inference(variable_rename,[status(thm)],[member_universal_self]) ).
cnf(c_0_6,negated_conjecture,
( ~ member(X1,universal_class)
| esk1_0 != singleton(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( member(member_of(X1),universal_class)
| member_of(X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X16] :
( singleton(member_of(X16)) = X16
| member_of(X16) = X16 ),
inference(variable_rename,[status(thm)],[singleton_self]) ).
cnf(c_0_9,negated_conjecture,
member_of(esk1_0) != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
esk1_0 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
( member_of(X1) = X1
| singleton(member_of(X1)) != esk1_0 ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_12,plain,
( singleton(member_of(X1)) = X1
| member_of(X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
member_of(esk1_0) != esk1_0,
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12])]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SET091+1 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.00/0.09 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon May 20 12:08:37 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.15/0.39 Running first-order model finding
% 0.15/0.39 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.15/0.40 # Version: 3.1.0
% 0.15/0.40 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.40 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.40 # Starting sh5l with 300s (1) cores
% 0.15/0.40 # new_bool_1 with pid 3336 completed with status 0
% 0.15/0.40 # Result found by new_bool_1
% 0.15/0.40 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.40 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.40 # Search class: FGHSF-FFSF11-MFFFFFNN
% 0.15/0.40 # partial match(1): FGHSF-FFSF11-SFFFFFNN
% 0.15/0.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.40 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.15/0.40 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 3338 completed with status 0
% 0.15/0.40 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.15/0.40 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.40 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.40 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.40 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.40 # Search class: FGHSF-FFSF11-MFFFFFNN
% 0.15/0.40 # partial match(1): FGHSF-FFSF11-SFFFFFNN
% 0.15/0.40 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.40 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.15/0.40 # Preprocessing time : 0.001 s
% 0.15/0.40 # Presaturation interreduction done
% 0.15/0.40
% 0.15/0.40 # Proof found!
% 0.15/0.40 # SZS status Theorem
% 0.15/0.40 # SZS output start CNFRefutation
% See solution above
% 0.15/0.40 # Parsed axioms : 48
% 0.15/0.40 # Removed by relevancy pruning/SinE : 43
% 0.15/0.40 # Initial clauses : 7
% 0.15/0.40 # Removed in clause preprocessing : 0
% 0.15/0.40 # Initial clauses in saturation : 7
% 0.15/0.40 # Processed clauses : 13
% 0.15/0.40 # ...of these trivial : 0
% 0.15/0.40 # ...subsumed : 0
% 0.15/0.40 # ...remaining for further processing : 13
% 0.15/0.40 # Other redundant clauses eliminated : 1
% 0.15/0.40 # Clauses deleted for lack of memory : 0
% 0.15/0.40 # Backward-subsumed : 0
% 0.15/0.40 # Backward-rewritten : 0
% 0.15/0.40 # Generated clauses : 3
% 0.15/0.40 # ...of the previous two non-redundant : 1
% 0.15/0.40 # ...aggressively subsumed : 0
% 0.15/0.40 # Contextual simplify-reflections : 0
% 0.15/0.40 # Paramodulations : 2
% 0.15/0.40 # Factorizations : 0
% 0.15/0.40 # NegExts : 0
% 0.15/0.40 # Equation resolutions : 1
% 0.15/0.40 # Disequality decompositions : 0
% 0.15/0.40 # Total rewrite steps : 1
% 0.15/0.40 # ...of those cached : 0
% 0.15/0.40 # Propositional unsat checks : 0
% 0.15/0.40 # Propositional check models : 0
% 0.15/0.40 # Propositional check unsatisfiable : 0
% 0.15/0.40 # Propositional clauses : 0
% 0.15/0.40 # Propositional clauses after purity: 0
% 0.15/0.40 # Propositional unsat core size : 0
% 0.15/0.40 # Propositional preprocessing time : 0.000
% 0.15/0.40 # Propositional encoding time : 0.000
% 0.15/0.40 # Propositional solver time : 0.000
% 0.15/0.40 # Success case prop preproc time : 0.000
% 0.15/0.40 # Success case prop encoding time : 0.000
% 0.15/0.40 # Success case prop solver time : 0.000
% 0.15/0.40 # Current number of processed clauses : 6
% 0.15/0.40 # Positive orientable unit clauses : 1
% 0.15/0.40 # Positive unorientable unit clauses: 0
% 0.15/0.40 # Negative unit clauses : 1
% 0.15/0.40 # Non-unit-clauses : 4
% 0.15/0.40 # Current number of unprocessed clauses: 2
% 0.15/0.40 # ...number of literals in the above : 4
% 0.15/0.40 # Current number of archived formulas : 0
% 0.15/0.40 # Current number of archived clauses : 7
% 0.15/0.40 # Clause-clause subsumption calls (NU) : 1
% 0.15/0.40 # Rec. Clause-clause subsumption calls : 1
% 0.15/0.40 # Non-unit clause-clause subsumptions : 0
% 0.15/0.40 # Unit Clause-clause subsumption calls : 0
% 0.15/0.40 # Rewrite failures with RHS unbound : 0
% 0.15/0.40 # BW rewrite match attempts : 0
% 0.15/0.40 # BW rewrite match successes : 0
% 0.15/0.40 # Condensation attempts : 0
% 0.15/0.40 # Condensation successes : 0
% 0.15/0.40 # Termbank termtop insertions : 888
% 0.15/0.40 # Search garbage collected termcells : 398
% 0.15/0.40
% 0.15/0.40 # -------------------------------------------------
% 0.15/0.40 # User time : 0.002 s
% 0.15/0.40 # System time : 0.002 s
% 0.15/0.40 # Total time : 0.004 s
% 0.15/0.40 # Maximum resident set size: 1896 pages
% 0.15/0.40
% 0.15/0.40 # -------------------------------------------------
% 0.15/0.40 # User time : 0.004 s
% 0.15/0.40 # System time : 0.003 s
% 0.15/0.40 # Total time : 0.007 s
% 0.15/0.40 # Maximum resident set size: 1756 pages
% 0.15/0.40 % E---3.1 exiting
%------------------------------------------------------------------------------