TSTP Solution File: SEU155+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU155+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:24:58 EDT 2023
% Result : Theorem 0.21s 0.48s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 3 unt; 0 def)
% Number of atoms : 58 ( 8 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 65 ( 23 ~; 27 |; 9 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 37 ( 0 sgn; 23 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d4_tarski,axiom,
! [X1,X2] :
( X2 = union(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X3,X4)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.6SP88pgkyZ/E---3.1_16249.p',d4_tarski) ).
fof(l50_zfmisc_1,conjecture,
! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.6SP88pgkyZ/E---3.1_16249.p',l50_zfmisc_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.6SP88pgkyZ/E---3.1_16249.p',d3_tarski) ).
fof(c_0_3,plain,
! [X14,X15,X16,X18,X19,X20,X21,X23] :
( ( in(X16,esk4_3(X14,X15,X16))
| ~ in(X16,X15)
| X15 != union(X14) )
& ( in(esk4_3(X14,X15,X16),X14)
| ~ in(X16,X15)
| X15 != union(X14) )
& ( ~ in(X18,X19)
| ~ in(X19,X14)
| in(X18,X15)
| X15 != union(X14) )
& ( ~ in(esk5_2(X20,X21),X21)
| ~ in(esk5_2(X20,X21),X23)
| ~ in(X23,X20)
| X21 = union(X20) )
& ( in(esk5_2(X20,X21),esk6_2(X20,X21))
| in(esk5_2(X20,X21),X21)
| X21 = union(X20) )
& ( in(esk6_2(X20,X21),X20)
| in(esk5_2(X20,X21),X21)
| X21 = union(X20) ) ),
inference(distribute,[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)],[d4_tarski])])])])])]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
inference(assume_negation,[status(cth)],[l50_zfmisc_1]) ).
cnf(c_0_5,plain,
( in(X1,X4)
| ~ in(X1,X2)
| ~ in(X2,X3)
| X4 != union(X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_6,negated_conjecture,
( in(esk1_0,esk2_0)
& ~ subset(esk1_0,union(esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_7,plain,
( in(X1,union(X2))
| ~ in(X3,X2)
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
in(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X7,X8,X9,X10,X11] :
( ( ~ subset(X7,X8)
| ~ in(X9,X7)
| in(X9,X8) )
& ( in(esk3_2(X10,X11),X10)
| subset(X10,X11) )
& ( ~ in(esk3_2(X10,X11),X11)
| subset(X10,X11) ) ),
inference(distribute,[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)],[d3_tarski])])])])])]) ).
cnf(c_0_10,negated_conjecture,
( in(X1,union(esk2_0))
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
( in(esk3_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( subset(esk1_0,X1)
| in(esk3_2(esk1_0,X1),union(esk2_0)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
~ subset(esk1_0,union(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU155+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n026.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 09:46:59 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 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/tmp/tmp.6SP88pgkyZ/E---3.1_16249.p
% 0.21/0.48 # Version: 3.1pre001
% 0.21/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.48 # Starting sh5l with 300s (1) cores
% 0.21/0.48 # new_bool_3 with pid 16328 completed with status 0
% 0.21/0.48 # Result found by new_bool_3
% 0.21/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.48 # Search class: FGHSF-FFSF32-SFFFFFNN
% 0.21/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.21/0.48 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 16331 completed with status 0
% 0.21/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.21/0.48 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.48 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.48 # Search class: FGHSF-FFSF32-SFFFFFNN
% 0.21/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 181s (1) cores
% 0.21/0.48 # Preprocessing time : 0.001 s
% 0.21/0.48 # Presaturation interreduction done
% 0.21/0.48
% 0.21/0.48 # Proof found!
% 0.21/0.48 # SZS status Theorem
% 0.21/0.48 # SZS output start CNFRefutation
% See solution above
% 0.21/0.48 # Parsed axioms : 6
% 0.21/0.48 # Removed by relevancy pruning/SinE : 1
% 0.21/0.48 # Initial clauses : 13
% 0.21/0.48 # Removed in clause preprocessing : 0
% 0.21/0.48 # Initial clauses in saturation : 13
% 0.21/0.48 # Processed clauses : 29
% 0.21/0.48 # ...of these trivial : 0
% 0.21/0.48 # ...subsumed : 0
% 0.21/0.48 # ...remaining for further processing : 29
% 0.21/0.48 # Other redundant clauses eliminated : 3
% 0.21/0.48 # Clauses deleted for lack of memory : 0
% 0.21/0.48 # Backward-subsumed : 0
% 0.21/0.48 # Backward-rewritten : 0
% 0.21/0.48 # Generated clauses : 15
% 0.21/0.48 # ...of the previous two non-redundant : 12
% 0.21/0.48 # ...aggressively subsumed : 0
% 0.21/0.48 # Contextual simplify-reflections : 0
% 0.21/0.48 # Paramodulations : 12
% 0.21/0.48 # Factorizations : 0
% 0.21/0.48 # NegExts : 0
% 0.21/0.48 # Equation resolutions : 3
% 0.21/0.48 # Total rewrite steps : 1
% 0.21/0.48 # Propositional unsat checks : 0
% 0.21/0.48 # Propositional check models : 0
% 0.21/0.48 # Propositional check unsatisfiable : 0
% 0.21/0.48 # Propositional clauses : 0
% 0.21/0.48 # Propositional clauses after purity: 0
% 0.21/0.48 # Propositional unsat core size : 0
% 0.21/0.48 # Propositional preprocessing time : 0.000
% 0.21/0.48 # Propositional encoding time : 0.000
% 0.21/0.48 # Propositional solver time : 0.000
% 0.21/0.48 # Success case prop preproc time : 0.000
% 0.21/0.48 # Success case prop encoding time : 0.000
% 0.21/0.48 # Success case prop solver time : 0.000
% 0.21/0.48 # Current number of processed clauses : 13
% 0.21/0.48 # Positive orientable unit clauses : 2
% 0.21/0.48 # Positive unorientable unit clauses: 0
% 0.21/0.48 # Negative unit clauses : 2
% 0.21/0.48 # Non-unit-clauses : 9
% 0.21/0.48 # Current number of unprocessed clauses: 6
% 0.21/0.48 # ...number of literals in the above : 17
% 0.21/0.48 # Current number of archived formulas : 0
% 0.21/0.48 # Current number of archived clauses : 13
% 0.21/0.48 # Clause-clause subsumption calls (NU) : 37
% 0.21/0.48 # Rec. Clause-clause subsumption calls : 36
% 0.21/0.48 # Non-unit clause-clause subsumptions : 0
% 0.21/0.48 # Unit Clause-clause subsumption calls : 1
% 0.21/0.48 # Rewrite failures with RHS unbound : 0
% 0.21/0.48 # BW rewrite match attempts : 1
% 0.21/0.48 # BW rewrite match successes : 0
% 0.21/0.48 # Condensation attempts : 0
% 0.21/0.48 # Condensation successes : 0
% 0.21/0.48 # Termbank termtop insertions : 1009
% 0.21/0.48
% 0.21/0.48 # -------------------------------------------------
% 0.21/0.48 # User time : 0.005 s
% 0.21/0.48 # System time : 0.001 s
% 0.21/0.48 # Total time : 0.006 s
% 0.21/0.48 # Maximum resident set size: 1724 pages
% 0.21/0.48
% 0.21/0.48 # -------------------------------------------------
% 0.21/0.48 # User time : 0.005 s
% 0.21/0.48 # System time : 0.004 s
% 0.21/0.48 # Total time : 0.009 s
% 0.21/0.48 # Maximum resident set size: 1676 pages
% 0.21/0.48 % E---3.1 exiting
% 0.21/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------