TSTP Solution File: SEU173+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU173+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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 : Sat May 4 09:25:28 EDT 2024
% Result : Theorem 0.16s 0.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 4 unt; 0 def)
% Number of atoms : 86 ( 6 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 96 ( 35 ~; 33 |; 12 &)
% ( 7 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 51 ( 1 sgn 34 !; 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.ZHfU8SIxwg/E---3.1_14758.p',d2_subset_1) ).
fof(l71_subset_1,conjecture,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
=> in(X3,X2) )
=> element(X1,powerset(X2)) ),
file('/export/starexec/sandbox/tmp/tmp.ZHfU8SIxwg/E---3.1_14758.p',l71_subset_1) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox/tmp/tmp.ZHfU8SIxwg/E---3.1_14758.p',t7_boole) ).
fof(d1_zfmisc_1,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.ZHfU8SIxwg/E---3.1_14758.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.ZHfU8SIxwg/E---3.1_14758.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] :
( ! [X3] :
( in(X3,X1)
=> in(X3,X2) )
=> element(X1,powerset(X2)) ),
inference(assume_negation,[status(cth)],[l71_subset_1]) ).
fof(c_0_7,plain,
! [X7,X8] :
( ( ~ element(X8,X7)
| in(X8,X7)
| empty(X7) )
& ( ~ in(X8,X7)
| element(X8,X7)
| empty(X7) )
& ( ~ element(X8,X7)
| empty(X8)
| ~ empty(X7) )
& ( ~ empty(X8)
| element(X8,X7)
| ~ empty(X7) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_8,plain,
! [X31,X32] :
( ~ in(X31,X32)
| ~ empty(X32) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])]) ).
fof(c_0_9,negated_conjecture,
! [X6] :
( ( ~ in(X6,esk1_0)
| in(X6,esk2_0) )
& ~ element(esk1_0,powerset(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_6])])])])]) ).
cnf(c_0_10,plain,
( element(X1,X2)
| empty(X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ in(X1,X2)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X15,X16,X17,X18,X19,X20] :
( ( ~ in(X17,X16)
| subset(X17,X15)
| X16 != powerset(X15) )
& ( ~ subset(X18,X15)
| in(X18,X16)
| X16 != powerset(X15) )
& ( ~ in(esk6_2(X19,X20),X20)
| ~ subset(esk6_2(X19,X20),X19)
| X20 = powerset(X19) )
& ( in(esk6_2(X19,X20),X20)
| subset(esk6_2(X19,X20),X19)
| X20 = powerset(X19) ) ),
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)],[d1_zfmisc_1])])])])])])]) ).
fof(c_0_13,plain,
! [X25,X26,X27,X28,X29] :
( ( ~ subset(X25,X26)
| ~ in(X27,X25)
| in(X27,X26) )
& ( in(esk7_2(X28,X29),X28)
| subset(X28,X29) )
& ( ~ in(esk7_2(X28,X29),X29)
| subset(X28,X29) ) ),
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)],[d3_tarski])])])])])])]) ).
cnf(c_0_14,negated_conjecture,
~ element(esk1_0,powerset(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
inference(csr,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( in(X1,X3)
| ~ subset(X1,X2)
| X3 != powerset(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( in(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,plain,
( in(esk7_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
~ in(esk1_0,powerset(esk2_0)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( in(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( subset(X1,X2)
| ~ in(esk7_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
( subset(esk1_0,X1)
| in(esk7_2(esk1_0,X1),esk2_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
~ subset(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SEU173+1 : TPTP v8.1.2. Released v3.3.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n023.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 08:06:53 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 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.ZHfU8SIxwg/E---3.1_14758.p
% 0.16/0.45 # Version: 3.1.0
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # sh5l with pid 14839 completed with status 0
% 0.16/0.45 # Result found by sh5l
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.45 # Search class: FGHSM-FFSF21-SFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.45 # SAT001_MinMin_p005000_rr_RG with pid 14846 completed with status 0
% 0.16/0.45 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45 # Starting sh5l with 300s (1) cores
% 0.16/0.45 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.45 # Search class: FGHSM-FFSF21-SFFFFFNN
% 0.16/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.45 # Preprocessing time : 0.001 s
% 0.16/0.45 # Presaturation interreduction done
% 0.16/0.45
% 0.16/0.45 # Proof found!
% 0.16/0.45 # SZS status Theorem
% 0.16/0.45 # SZS output start CNFRefutation
% See solution above
% 0.16/0.45 # Parsed axioms : 19
% 0.16/0.45 # Removed by relevancy pruning/SinE : 3
% 0.16/0.45 # Initial clauses : 27
% 0.16/0.45 # Removed in clause preprocessing : 0
% 0.16/0.45 # Initial clauses in saturation : 27
% 0.16/0.45 # Processed clauses : 102
% 0.16/0.45 # ...of these trivial : 0
% 0.16/0.45 # ...subsumed : 13
% 0.16/0.45 # ...remaining for further processing : 89
% 0.16/0.45 # Other redundant clauses eliminated : 2
% 0.16/0.45 # Clauses deleted for lack of memory : 0
% 0.16/0.45 # Backward-subsumed : 3
% 0.16/0.45 # Backward-rewritten : 2
% 0.16/0.45 # Generated clauses : 87
% 0.16/0.45 # ...of the previous two non-redundant : 68
% 0.16/0.45 # ...aggressively subsumed : 0
% 0.16/0.45 # Contextual simplify-reflections : 1
% 0.16/0.45 # Paramodulations : 84
% 0.16/0.45 # Factorizations : 0
% 0.16/0.45 # NegExts : 0
% 0.16/0.45 # Equation resolutions : 2
% 0.16/0.45 # Disequality decompositions : 0
% 0.16/0.45 # Total rewrite steps : 12
% 0.16/0.45 # ...of those cached : 7
% 0.16/0.45 # Propositional unsat checks : 0
% 0.16/0.45 # Propositional check models : 0
% 0.16/0.45 # Propositional check unsatisfiable : 0
% 0.16/0.45 # Propositional clauses : 0
% 0.16/0.45 # Propositional clauses after purity: 0
% 0.16/0.45 # Propositional unsat core size : 0
% 0.16/0.45 # Propositional preprocessing time : 0.000
% 0.16/0.45 # Propositional encoding time : 0.000
% 0.16/0.45 # Propositional solver time : 0.000
% 0.16/0.45 # Success case prop preproc time : 0.000
% 0.16/0.45 # Success case prop encoding time : 0.000
% 0.16/0.45 # Success case prop solver time : 0.000
% 0.16/0.45 # Current number of processed clauses : 54
% 0.16/0.45 # Positive orientable unit clauses : 10
% 0.16/0.45 # Positive unorientable unit clauses: 0
% 0.16/0.45 # Negative unit clauses : 10
% 0.16/0.45 # Non-unit-clauses : 34
% 0.16/0.45 # Current number of unprocessed clauses: 16
% 0.16/0.45 # ...number of literals in the above : 46
% 0.16/0.45 # Current number of archived formulas : 0
% 0.16/0.45 # Current number of archived clauses : 33
% 0.16/0.45 # Clause-clause subsumption calls (NU) : 125
% 0.16/0.45 # Rec. Clause-clause subsumption calls : 100
% 0.16/0.45 # Non-unit clause-clause subsumptions : 5
% 0.16/0.45 # Unit Clause-clause subsumption calls : 60
% 0.16/0.45 # Rewrite failures with RHS unbound : 0
% 0.16/0.45 # BW rewrite match attempts : 2
% 0.16/0.45 # BW rewrite match successes : 2
% 0.16/0.45 # Condensation attempts : 0
% 0.16/0.45 # Condensation successes : 0
% 0.16/0.45 # Termbank termtop insertions : 2455
% 0.16/0.45 # Search garbage collected termcells : 392
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.007 s
% 0.16/0.45 # System time : 0.001 s
% 0.16/0.45 # Total time : 0.008 s
% 0.16/0.45 # Maximum resident set size: 1704 pages
% 0.16/0.45
% 0.16/0.45 # -------------------------------------------------
% 0.16/0.45 # User time : 0.008 s
% 0.16/0.45 # System time : 0.002 s
% 0.16/0.45 # Total time : 0.011 s
% 0.16/0.45 # Maximum resident set size: 1704 pages
% 0.16/0.45 % E---3.1 exiting
% 0.16/0.45 % E exiting
%------------------------------------------------------------------------------