TSTP Solution File: SEU435+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU435+3 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:32 EDT 2023
% Result : Theorem 6.70s 6.09s
% Output : CNFRefutation 6.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 10 ( 4 unt; 0 def)
% Number of atoms : 22 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 19 ( 7 ~; 4 |; 3 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-6 aty)
% Number of variables : 30 ( 0 sgn; 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t36_relset_2,conjecture,
! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X1,X2))))
=> ! [X4,X5,X6] :
( m1_subset_1(X6,k1_zfmisc_1(X4))
=> m1_subset_1(a_6_0_relset_2(X1,X2,X3,X4,X5,X6),k1_zfmisc_1(k1_zfmisc_1(X5))) ) ),
file('/export/starexec/sandbox/tmp/tmp.txne4mm6ct/E---3.1_1425.p',t36_relset_2) ).
fof(s8_domain_1__e1_46__relset_2,axiom,
! [X1,X2,X3,X4,X5,X6] :
( ( m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X1,X2))))
& m1_subset_1(X6,k1_zfmisc_1(X4)) )
=> m1_subset_1(a_6_0_relset_2(X1,X2,X3,X4,X5,X6),k1_zfmisc_1(k1_zfmisc_1(X5))) ),
file('/export/starexec/sandbox/tmp/tmp.txne4mm6ct/E---3.1_1425.p',s8_domain_1__e1_46__relset_2) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X1,X2))))
=> ! [X4,X5,X6] :
( m1_subset_1(X6,k1_zfmisc_1(X4))
=> m1_subset_1(a_6_0_relset_2(X1,X2,X3,X4,X5,X6),k1_zfmisc_1(k1_zfmisc_1(X5))) ) ),
inference(assume_negation,[status(cth)],[t36_relset_2]) ).
fof(c_0_3,negated_conjecture,
( m1_subset_1(esk3_0,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0))))
& m1_subset_1(esk6_0,k1_zfmisc_1(esk4_0))
& ~ m1_subset_1(a_6_0_relset_2(esk1_0,esk2_0,esk3_0,esk4_0,esk5_0,esk6_0),k1_zfmisc_1(k1_zfmisc_1(esk5_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_4,plain,
! [X54,X55,X56,X57,X58,X59] :
( ~ m1_subset_1(X56,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X54,X55))))
| ~ m1_subset_1(X59,k1_zfmisc_1(X57))
| m1_subset_1(a_6_0_relset_2(X54,X55,X56,X57,X58,X59),k1_zfmisc_1(k1_zfmisc_1(X58))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[s8_domain_1__e1_46__relset_2])]) ).
cnf(c_0_5,negated_conjecture,
~ m1_subset_1(a_6_0_relset_2(esk1_0,esk2_0,esk3_0,esk4_0,esk5_0,esk6_0),k1_zfmisc_1(k1_zfmisc_1(esk5_0))),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( m1_subset_1(a_6_0_relset_2(X2,X3,X1,X5,X6,X4),k1_zfmisc_1(k1_zfmisc_1(X6)))
| ~ m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X2,X3))))
| ~ m1_subset_1(X4,k1_zfmisc_1(X5)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0)))),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
m1_subset_1(esk6_0,k1_zfmisc_1(esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 1.21/1.24 % Problem : SEU435+3 : TPTP v8.1.2. Released v3.4.0.
% 1.21/1.25 % Command : run_E %s %d THM
% 1.25/1.46 % Computer : n017.cluster.edu
% 1.25/1.46 % Model : x86_64 x86_64
% 1.25/1.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.25/1.46 % Memory : 8042.1875MB
% 1.25/1.46 % OS : Linux 3.10.0-693.el7.x86_64
% 1.25/1.46 % CPULimit : 2400
% 1.25/1.46 % WCLimit : 300
% 1.25/1.46 % DateTime : Mon Oct 2 08:15:59 EDT 2023
% 1.25/1.46 % CPUTime :
% 4.96/5.17 Running first-order theorem proving
% 4.96/5.17 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.txne4mm6ct/E---3.1_1425.p
% 6.70/6.09 # Version: 3.1pre001
% 6.70/6.09 # Preprocessing class: FMLLMMLLSSSNFFN.
% 6.70/6.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.70/6.09 # Starting new_bool_3 with 900s (3) cores
% 6.70/6.09 # Starting new_bool_1 with 900s (3) cores
% 6.70/6.09 # Starting sh5l with 300s (1) cores
% 6.70/6.09 # Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 6.70/6.09 # new_bool_1 with pid 1505 completed with status 0
% 6.70/6.09 # Result found by new_bool_1
% 6.70/6.09 # Preprocessing class: FMLLMMLLSSSNFFN.
% 6.70/6.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.70/6.09 # Starting new_bool_3 with 900s (3) cores
% 6.70/6.09 # Starting new_bool_1 with 900s (3) cores
% 6.70/6.09 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 6.70/6.09 # Search class: FGHSM-FSLM32-MFFFFFNN
% 6.70/6.09 # Scheduled 12 strats onto 3 cores with 900 seconds (900 total)
% 6.70/6.09 # Starting G-E--_303_C18_F1_URBAN_S0Y with 74s (1) cores
% 6.70/6.09 # Starting new_bool_1 with 91s (1) cores
% 6.70/6.09 # Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 74s (1) cores
% 6.70/6.09 # G-E--_303_C18_F1_URBAN_S0Y with pid 1511 completed with status 0
% 6.70/6.09 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 6.70/6.09 # Preprocessing class: FMLLMMLLSSSNFFN.
% 6.70/6.09 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.70/6.09 # Starting new_bool_3 with 900s (3) cores
% 6.70/6.09 # Starting new_bool_1 with 900s (3) cores
% 6.70/6.09 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 6.70/6.09 # Search class: FGHSM-FSLM32-MFFFFFNN
% 6.70/6.09 # Scheduled 12 strats onto 3 cores with 900 seconds (900 total)
% 6.70/6.09 # Starting G-E--_303_C18_F1_URBAN_S0Y with 74s (1) cores
% 6.70/6.09 # Preprocessing time : 0.038 s
% 6.70/6.09
% 6.70/6.09 # Proof found!
% 6.70/6.09 # SZS status Theorem
% 6.70/6.09 # SZS output start CNFRefutation
% See solution above
% 6.70/6.09 # Parsed axioms : 19109
% 6.70/6.09 # Removed by relevancy pruning/SinE : 18839
% 6.70/6.09 # Initial clauses : 445
% 6.70/6.09 # Removed in clause preprocessing : 15
% 6.70/6.09 # Initial clauses in saturation : 430
% 6.70/6.09 # Processed clauses : 190
% 6.70/6.09 # ...of these trivial : 4
% 6.70/6.09 # ...subsumed : 11
% 6.70/6.09 # ...remaining for further processing : 175
% 6.70/6.09 # Other redundant clauses eliminated : 3
% 6.70/6.09 # Clauses deleted for lack of memory : 0
% 6.70/6.09 # Backward-subsumed : 1
% 6.70/6.09 # Backward-rewritten : 1
% 6.70/6.09 # Generated clauses : 526
% 6.70/6.09 # ...of the previous two non-redundant : 428
% 6.70/6.09 # ...aggressively subsumed : 0
% 6.70/6.09 # Contextual simplify-reflections : 2
% 6.70/6.09 # Paramodulations : 514
% 6.70/6.09 # Factorizations : 0
% 6.70/6.09 # NegExts : 0
% 6.70/6.09 # Equation resolutions : 12
% 6.70/6.09 # Total rewrite steps : 93
% 6.70/6.09 # Propositional unsat checks : 0
% 6.70/6.09 # Propositional check models : 0
% 6.70/6.09 # Propositional check unsatisfiable : 0
% 6.70/6.09 # Propositional clauses : 0
% 6.70/6.09 # Propositional clauses after purity: 0
% 6.70/6.09 # Propositional unsat core size : 0
% 6.70/6.09 # Propositional preprocessing time : 0.000
% 6.70/6.09 # Propositional encoding time : 0.000
% 6.70/6.09 # Propositional solver time : 0.000
% 6.70/6.09 # Success case prop preproc time : 0.000
% 6.70/6.09 # Success case prop encoding time : 0.000
% 6.70/6.09 # Success case prop solver time : 0.000
% 6.70/6.09 # Current number of processed clauses : 170
% 6.70/6.09 # Positive orientable unit clauses : 33
% 6.70/6.09 # Positive unorientable unit clauses: 0
% 6.70/6.09 # Negative unit clauses : 5
% 6.70/6.09 # Non-unit-clauses : 132
% 6.70/6.09 # Current number of unprocessed clauses: 664
% 6.70/6.09 # ...number of literals in the above : 2406
% 6.70/6.09 # Current number of archived formulas : 0
% 6.70/6.09 # Current number of archived clauses : 2
% 6.70/6.09 # Clause-clause subsumption calls (NU) : 5509
% 6.70/6.09 # Rec. Clause-clause subsumption calls : 3313
% 6.70/6.09 # Non-unit clause-clause subsumptions : 12
% 6.70/6.09 # Unit Clause-clause subsumption calls : 120
% 6.70/6.09 # Rewrite failures with RHS unbound : 0
% 6.70/6.09 # BW rewrite match attempts : 1
% 6.70/6.09 # BW rewrite match successes : 1
% 6.70/6.09 # Condensation attempts : 0
% 6.70/6.09 # Condensation successes : 0
% 6.70/6.09 # Termbank termtop insertions : 578634
% 6.70/6.09
% 6.70/6.09 # -------------------------------------------------
% 6.70/6.09 # User time : 0.177 s
% 6.70/6.09 # System time : 0.073 s
% 6.70/6.09 # Total time : 0.250 s
% 6.70/6.09 # Maximum resident set size: 38900 pages
% 6.70/6.09
% 6.70/6.09 # -------------------------------------------------
% 6.70/6.09 # User time : 0.914 s
% 6.70/6.09 # System time : 0.109 s
% 6.70/6.09 # Total time : 1.023 s
% 6.70/6.09 # Maximum resident set size: 29740 pages
% 6.70/6.09 % E---3.1 exiting
% 6.70/6.10 % E---3.1 exiting
%------------------------------------------------------------------------------