TSTP Solution File: SEU169+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU169+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:25:05 EDT 2023
% Result : Theorem 0.41s 0.52s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 10 unt; 0 def)
% Number of atoms : 81 ( 7 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 87 ( 31 ~; 28 |; 12 &)
% ( 7 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 43 ( 1 sgn; 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d2_subset_1,axiom,
! [X1,X2] :
( ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) )
& ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.ZmHHXmKBNL/E---3.1_4349.p',d2_subset_1) ).
fof(l3_subset_1,conjecture,
! [X1,X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( in(X3,X2)
=> in(X3,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.ZmHHXmKBNL/E---3.1_4349.p',l3_subset_1) ).
fof(fc1_subset_1,axiom,
! [X1] : ~ empty(powerset(X1)),
file('/export/starexec/sandbox/tmp/tmp.ZmHHXmKBNL/E---3.1_4349.p',fc1_subset_1) ).
fof(d1_zfmisc_1,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.ZmHHXmKBNL/E---3.1_4349.p',d1_zfmisc_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.ZmHHXmKBNL/E---3.1_4349.p',d3_tarski) ).
fof(c_0_5,plain,
! [X1,X2] :
( ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) )
& ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) ) ),
inference(fof_simplification,[status(thm)],[d2_subset_1]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( in(X3,X2)
=> in(X3,X1) ) ),
inference(assume_negation,[status(cth)],[l3_subset_1]) ).
fof(c_0_7,plain,
! [X1] : ~ empty(powerset(X1)),
inference(fof_simplification,[status(thm)],[fc1_subset_1]) ).
fof(c_0_8,plain,
! [X21,X22] :
( ( ~ element(X22,X21)
| in(X22,X21)
| empty(X21) )
& ( ~ in(X22,X21)
| element(X22,X21)
| empty(X21) )
& ( ~ element(X22,X21)
| empty(X22)
| ~ empty(X21) )
& ( ~ empty(X22)
| element(X22,X21)
| ~ empty(X21) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_9,negated_conjecture,
( element(esk2_0,powerset(esk1_0))
& in(esk3_0,esk2_0)
& ~ in(esk3_0,esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_10,plain,
! [X34] : ~ empty(powerset(X34)),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X27,X28,X29,X30,X31,X32] :
( ( ~ in(X29,X28)
| subset(X29,X27)
| X28 != powerset(X27) )
& ( ~ subset(X30,X27)
| in(X30,X28)
| X28 != powerset(X27) )
& ( ~ in(esk8_2(X31,X32),X32)
| ~ subset(esk8_2(X31,X32),X31)
| X32 = powerset(X31) )
& ( in(esk8_2(X31,X32),X32)
| subset(esk8_2(X31,X32),X31)
| X32 = powerset(X31) ) ),
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)],[d1_zfmisc_1])])])])])]) ).
cnf(c_0_12,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
element(esk2_0,powerset(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
~ empty(powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( subset(X1,X3)
| ~ in(X1,X2)
| X2 != powerset(X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
in(esk2_0,powerset(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
fof(c_0_17,plain,
! [X12,X13,X14,X15,X16] :
( ( ~ subset(X12,X13)
| ~ in(X14,X12)
| in(X14,X13) )
& ( in(esk4_2(X15,X16),X15)
| subset(X15,X16) )
& ( ~ in(esk4_2(X15,X16),X16)
| subset(X15,X16) ) ),
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_18,negated_conjecture,
( subset(esk2_0,X1)
| powerset(esk1_0) != powerset(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,negated_conjecture,
subset(esk2_0,esk1_0),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
~ in(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
( in(X1,esk1_0)
| ~ in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
in(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU169+2 : TPTP v8.1.2. Released v3.3.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n011.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 08:23:38 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.ZmHHXmKBNL/E---3.1_4349.p
% 0.41/0.52 # Version: 3.1pre001
% 0.41/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.41/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.41/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.41/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.41/0.52 # Starting sh5l with 300s (1) cores
% 0.41/0.52 # new_bool_3 with pid 4428 completed with status 0
% 0.41/0.52 # Result found by new_bool_3
% 0.41/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.41/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.41/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.41/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.41/0.52 # Search class: FGHSM-FFMS31-SFFFFFNN
% 0.41/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.41/0.52 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 181s (1) cores
% 0.41/0.52 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 4431 completed with status 0
% 0.41/0.52 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.41/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.41/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.41/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.41/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.41/0.52 # Search class: FGHSM-FFMS31-SFFFFFNN
% 0.41/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.41/0.52 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 181s (1) cores
% 0.41/0.52 # Preprocessing time : 0.003 s
% 0.41/0.52
% 0.41/0.52 # Proof found!
% 0.41/0.52 # SZS status Theorem
% 0.41/0.52 # SZS output start CNFRefutation
% See solution above
% 0.41/0.52 # Parsed axioms : 105
% 0.41/0.52 # Removed by relevancy pruning/SinE : 42
% 0.41/0.52 # Initial clauses : 107
% 0.41/0.52 # Removed in clause preprocessing : 0
% 0.41/0.52 # Initial clauses in saturation : 107
% 0.41/0.52 # Processed clauses : 153
% 0.41/0.52 # ...of these trivial : 0
% 0.41/0.52 # ...subsumed : 25
% 0.41/0.52 # ...remaining for further processing : 128
% 0.41/0.52 # Other redundant clauses eliminated : 29
% 0.41/0.52 # Clauses deleted for lack of memory : 0
% 0.41/0.52 # Backward-subsumed : 1
% 0.41/0.52 # Backward-rewritten : 1
% 0.41/0.52 # Generated clauses : 558
% 0.41/0.52 # ...of the previous two non-redundant : 425
% 0.41/0.52 # ...aggressively subsumed : 0
% 0.41/0.52 # Contextual simplify-reflections : 1
% 0.41/0.52 # Paramodulations : 495
% 0.41/0.52 # Factorizations : 20
% 0.41/0.52 # NegExts : 0
% 0.41/0.52 # Equation resolutions : 43
% 0.41/0.52 # Total rewrite steps : 65
% 0.41/0.52 # Propositional unsat checks : 0
% 0.41/0.52 # Propositional check models : 0
% 0.41/0.52 # Propositional check unsatisfiable : 0
% 0.41/0.52 # Propositional clauses : 0
% 0.41/0.52 # Propositional clauses after purity: 0
% 0.41/0.52 # Propositional unsat core size : 0
% 0.41/0.52 # Propositional preprocessing time : 0.000
% 0.41/0.52 # Propositional encoding time : 0.000
% 0.41/0.52 # Propositional solver time : 0.000
% 0.41/0.52 # Success case prop preproc time : 0.000
% 0.41/0.52 # Success case prop encoding time : 0.000
% 0.41/0.52 # Success case prop solver time : 0.000
% 0.41/0.52 # Current number of processed clauses : 123
% 0.41/0.52 # Positive orientable unit clauses : 25
% 0.41/0.52 # Positive unorientable unit clauses: 2
% 0.41/0.52 # Negative unit clauses : 12
% 0.41/0.52 # Non-unit-clauses : 84
% 0.41/0.52 # Current number of unprocessed clauses: 370
% 0.41/0.52 # ...number of literals in the above : 1016
% 0.41/0.52 # Current number of archived formulas : 0
% 0.41/0.52 # Current number of archived clauses : 2
% 0.41/0.52 # Clause-clause subsumption calls (NU) : 666
% 0.41/0.52 # Rec. Clause-clause subsumption calls : 481
% 0.41/0.52 # Non-unit clause-clause subsumptions : 14
% 0.41/0.52 # Unit Clause-clause subsumption calls : 147
% 0.41/0.52 # Rewrite failures with RHS unbound : 0
% 0.41/0.52 # BW rewrite match attempts : 18
% 0.41/0.52 # BW rewrite match successes : 15
% 0.41/0.52 # Condensation attempts : 0
% 0.41/0.52 # Condensation successes : 0
% 0.41/0.52 # Termbank termtop insertions : 9552
% 0.41/0.52
% 0.41/0.52 # -------------------------------------------------
% 0.41/0.52 # User time : 0.020 s
% 0.41/0.52 # System time : 0.004 s
% 0.41/0.52 # Total time : 0.024 s
% 0.41/0.52 # Maximum resident set size: 2080 pages
% 0.41/0.52
% 0.41/0.52 # -------------------------------------------------
% 0.41/0.52 # User time : 0.022 s
% 0.41/0.52 # System time : 0.007 s
% 0.41/0.52 # Total time : 0.029 s
% 0.41/0.52 # Maximum resident set size: 1768 pages
% 0.41/0.52 % E---3.1 exiting
% 0.41/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------