TSTP Solution File: SEU430+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU430+3 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:26:30 EDT 2023
% Result : Theorem 6.89s 6.32s
% Output : CNFRefutation 6.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 5 unt; 0 def)
% Number of atoms : 60 ( 38 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 66 ( 28 ~; 21 |; 10 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn; 16 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t30_relset_2,conjecture,
! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> ( k5_setfam_1(X1,X2) = k1_xboole_0
<=> ! [X3] :
( r2_hidden(X3,X2)
=> X3 = k1_xboole_0 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WqsiJiMvyT/E---3.1_24270.p',t30_relset_2) ).
fof(redefinition_k5_setfam_1,axiom,
! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> k5_setfam_1(X1,X2) = k3_tarski(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.WqsiJiMvyT/E---3.1_24270.p',redefinition_k5_setfam_1) ).
fof(t91_orders_1,axiom,
! [X1] :
( ~ ( ? [X2] :
( X2 != k1_xboole_0
& r2_hidden(X2,X1) )
& k3_tarski(X1) = k1_xboole_0 )
& ~ ( k3_tarski(X1) != k1_xboole_0
& ! [X2] :
~ ( X2 != k1_xboole_0
& r2_hidden(X2,X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WqsiJiMvyT/E---3.1_24270.p',t91_orders_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> ( k5_setfam_1(X1,X2) = k1_xboole_0
<=> ! [X3] :
( r2_hidden(X3,X2)
=> X3 = k1_xboole_0 ) ) ),
inference(assume_negation,[status(cth)],[t30_relset_2]) ).
fof(c_0_4,plain,
! [X130,X131] :
( ~ m1_subset_1(X131,k1_zfmisc_1(k1_zfmisc_1(X130)))
| k5_setfam_1(X130,X131) = k3_tarski(X131) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k5_setfam_1])]) ).
fof(c_0_5,negated_conjecture,
! [X18] :
( m1_subset_1(esk2_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0)))
& ( r2_hidden(esk3_0,esk2_0)
| k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0 )
& ( esk3_0 != k1_xboole_0
| k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0 )
& ( k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0
| ~ r2_hidden(X18,esk2_0)
| X18 = k1_xboole_0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
cnf(c_0_6,plain,
( k5_setfam_1(X2,X1) = k3_tarski(X1)
| ~ m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X351,X352,X353] :
( ( X352 = k1_xboole_0
| ~ r2_hidden(X352,X351)
| k3_tarski(X351) != k1_xboole_0 )
& ( esk51_1(X353) != k1_xboole_0
| k3_tarski(X353) = k1_xboole_0 )
& ( r2_hidden(esk51_1(X353),X353)
| k3_tarski(X353) = k1_xboole_0 ) ),
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)],[t91_orders_1])])])])])]) ).
cnf(c_0_9,negated_conjecture,
( r2_hidden(esk3_0,esk2_0)
| k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
k5_setfam_1(esk1_0,esk2_0) = k3_tarski(esk2_0),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( esk3_0 != k1_xboole_0
| k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
( k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0
| X1 = k1_xboole_0
| ~ r2_hidden(X1,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
( X1 = k1_xboole_0
| ~ r2_hidden(X1,X2)
| k3_tarski(X2) != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
( r2_hidden(esk3_0,esk2_0)
| k3_tarski(esk2_0) != k1_xboole_0 ),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( k3_tarski(esk2_0) != k1_xboole_0
| esk3_0 != k1_xboole_0 ),
inference(rw,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( X1 = k1_xboole_0
| ~ r2_hidden(X1,esk2_0) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_10]),c_0_13]) ).
cnf(c_0_17,plain,
( r2_hidden(esk51_1(X1),X1)
| k3_tarski(X1) = k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
k3_tarski(esk2_0) != k1_xboole_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_19,plain,
( k3_tarski(X1) = k1_xboole_0
| esk51_1(X1) != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,negated_conjecture,
esk51_1(esk2_0) = k1_xboole_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 1.12/1.22 % Problem : SEU430+3 : TPTP v8.1.2. Released v3.4.0.
% 1.12/1.24 % Command : run_E %s %d THM
% 1.27/1.45 % Computer : n018.cluster.edu
% 1.27/1.45 % Model : x86_64 x86_64
% 1.27/1.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.27/1.45 % Memory : 8042.1875MB
% 1.27/1.45 % OS : Linux 3.10.0-693.el7.x86_64
% 1.27/1.45 % CPULimit : 2400
% 1.27/1.45 % WCLimit : 300
% 1.27/1.45 % DateTime : Mon Oct 2 09:31:42 EDT 2023
% 1.27/1.45 % CPUTime :
% 4.95/5.23 Running first-order theorem proving
% 4.95/5.23 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.WqsiJiMvyT/E---3.1_24270.p
% 6.89/6.32 # Version: 3.1pre001
% 6.89/6.32 # Preprocessing class: FMLLMMLLSSSNFFN.
% 6.89/6.32 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.89/6.32 # Starting new_bool_3 with 900s (3) cores
% 6.89/6.32 # Starting new_bool_1 with 900s (3) cores
% 6.89/6.32 # Starting sh5l with 300s (1) cores
% 6.89/6.32 # Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 6.89/6.32 # G-E--_211_C18_F1_AE_CS_SP_S0Y with pid 24351 completed with status 0
% 6.89/6.32 # Result found by G-E--_211_C18_F1_AE_CS_SP_S0Y
% 6.89/6.32 # Preprocessing class: FMLLMMLLSSSNFFN.
% 6.89/6.32 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.89/6.32 # Starting new_bool_3 with 900s (3) cores
% 6.89/6.32 # Starting new_bool_1 with 900s (3) cores
% 6.89/6.32 # Starting sh5l with 300s (1) cores
% 6.89/6.32 # Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 6.89/6.32 # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 6.89/6.32 # Search class: FGHSM-FMLM32-DFFFFFNN
% 6.89/6.32 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 6.89/6.32 # Starting new_ho_10 with 55s (1) cores
% 6.89/6.32 # new_ho_10 with pid 24352 completed with status 0
% 6.89/6.32 # Result found by new_ho_10
% 6.89/6.32 # Preprocessing class: FMLLMMLLSSSNFFN.
% 6.89/6.32 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.89/6.32 # Starting new_bool_3 with 900s (3) cores
% 6.89/6.32 # Starting new_bool_1 with 900s (3) cores
% 6.89/6.32 # Starting sh5l with 300s (1) cores
% 6.89/6.32 # Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 6.89/6.32 # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 6.89/6.32 # Search class: FGHSM-FMLM32-DFFFFFNN
% 6.89/6.32 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 6.89/6.32 # Starting new_ho_10 with 55s (1) cores
% 6.89/6.32 # Preprocessing time : 0.037 s
% 6.89/6.32 # Presaturation interreduction done
% 6.89/6.32
% 6.89/6.32 # Proof found!
% 6.89/6.32 # SZS status Theorem
% 6.89/6.32 # SZS output start CNFRefutation
% See solution above
% 6.89/6.32 # Parsed axioms : 19101
% 6.89/6.32 # Removed by relevancy pruning/SinE : 18600
% 6.89/6.32 # Initial clauses : 993
% 6.89/6.32 # Removed in clause preprocessing : 14
% 6.89/6.32 # Initial clauses in saturation : 979
% 6.89/6.32 # Processed clauses : 1246
% 6.89/6.32 # ...of these trivial : 14
% 6.89/6.32 # ...subsumed : 102
% 6.89/6.32 # ...remaining for further processing : 1130
% 6.89/6.32 # Other redundant clauses eliminated : 91
% 6.89/6.32 # Clauses deleted for lack of memory : 0
% 6.89/6.32 # Backward-subsumed : 6
% 6.89/6.32 # Backward-rewritten : 15
% 6.89/6.32 # Generated clauses : 336
% 6.89/6.32 # ...of the previous two non-redundant : 287
% 6.89/6.32 # ...aggressively subsumed : 0
% 6.89/6.32 # Contextual simplify-reflections : 75
% 6.89/6.32 # Paramodulations : 251
% 6.89/6.32 # Factorizations : 0
% 6.89/6.32 # NegExts : 0
% 6.89/6.32 # Equation resolutions : 91
% 6.89/6.32 # Total rewrite steps : 162
% 6.89/6.32 # Propositional unsat checks : 0
% 6.89/6.32 # Propositional check models : 0
% 6.89/6.32 # Propositional check unsatisfiable : 0
% 6.89/6.32 # Propositional clauses : 0
% 6.89/6.32 # Propositional clauses after purity: 0
% 6.89/6.32 # Propositional unsat core size : 0
% 6.89/6.32 # Propositional preprocessing time : 0.000
% 6.89/6.32 # Propositional encoding time : 0.000
% 6.89/6.32 # Propositional solver time : 0.000
% 6.89/6.32 # Success case prop preproc time : 0.000
% 6.89/6.32 # Success case prop encoding time : 0.000
% 6.89/6.32 # Success case prop solver time : 0.000
% 6.89/6.32 # Current number of processed clauses : 159
% 6.89/6.32 # Positive orientable unit clauses : 60
% 6.89/6.32 # Positive unorientable unit clauses: 0
% 6.89/6.32 # Negative unit clauses : 19
% 6.89/6.32 # Non-unit-clauses : 80
% 6.89/6.32 # Current number of unprocessed clauses: 883
% 6.89/6.32 # ...number of literals in the above : 3797
% 6.89/6.32 # Current number of archived formulas : 0
% 6.89/6.32 # Current number of archived clauses : 891
% 6.89/6.32 # Clause-clause subsumption calls (NU) : 354428
% 6.89/6.32 # Rec. Clause-clause subsumption calls : 37723
% 6.89/6.32 # Non-unit clause-clause subsumptions : 177
% 6.89/6.32 # Unit Clause-clause subsumption calls : 474
% 6.89/6.32 # Rewrite failures with RHS unbound : 0
% 6.89/6.32 # BW rewrite match attempts : 80
% 6.89/6.32 # BW rewrite match successes : 35
% 6.89/6.32 # Condensation attempts : 1246
% 6.89/6.32 # Condensation successes : 20
% 6.89/6.32 # Termbank termtop insertions : 647122
% 6.89/6.32
% 6.89/6.32 # -------------------------------------------------
% 6.89/6.32 # User time : 0.460 s
% 6.89/6.32 # System time : 0.063 s
% 6.89/6.32 # Total time : 0.523 s
% 6.89/6.32 # Maximum resident set size: 38724 pages
% 6.89/6.32
% 6.89/6.32 # -------------------------------------------------
% 6.89/6.32 # User time : 0.979 s
% 6.89/6.32 # System time : 0.077 s
% 6.89/6.32 # Total time : 1.056 s
% 6.89/6.32 # Maximum resident set size: 29724 pages
% 6.89/6.32 % E---3.1 exiting
% 6.89/6.33 % E---3.1 exiting
%------------------------------------------------------------------------------