TSTP Solution File: SEU435+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU435+1 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 0.21s 0.52s
% Output : CNFRefutation 0.21s
% 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/sandbox2/tmp/tmp.RsgLx6XhTH/E---3.1_23476.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/sandbox2/tmp/tmp.RsgLx6XhTH/E---3.1_23476.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,
! [X47,X48,X49,X50,X51,X52] :
( ~ m1_subset_1(X49,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X47,X48))))
| ~ m1_subset_1(X52,k1_zfmisc_1(X50))
| m1_subset_1(a_6_0_relset_2(X47,X48,X49,X50,X51,X52),k1_zfmisc_1(k1_zfmisc_1(X51))) ),
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
% 0.12/0.13 % Problem : SEU435+1 : TPTP v8.1.2. Released v3.4.0.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n013.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 08:55:14 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.RsgLx6XhTH/E---3.1_23476.p
% 0.21/0.52 # Version: 3.1pre001
% 0.21/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # sh5l with pid 23557 completed with status 0
% 0.21/0.52 # Result found by sh5l
% 0.21/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52 # Search class: FGHSM-FFMM32-MFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.21/0.52 # G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with pid 23564 completed with status 0
% 0.21/0.52 # Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0Y
% 0.21/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.52 # Search class: FGHSM-FFMM32-MFFFFFNN
% 0.21/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.21/0.52 # Preprocessing time : 0.002 s
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Theorem
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 51
% 0.21/0.52 # Removed by relevancy pruning/SinE : 9
% 0.21/0.52 # Initial clauses : 62
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 62
% 0.21/0.52 # Processed clauses : 56
% 0.21/0.52 # ...of these trivial : 2
% 0.21/0.52 # ...subsumed : 0
% 0.21/0.52 # ...remaining for further processing : 54
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 0
% 0.21/0.52 # Backward-rewritten : 0
% 0.21/0.52 # Generated clauses : 44
% 0.21/0.52 # ...of the previous two non-redundant : 39
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 0
% 0.21/0.52 # Paramodulations : 44
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Total rewrite steps : 4
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 54
% 0.21/0.52 # Positive orientable unit clauses : 21
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 3
% 0.21/0.52 # Non-unit-clauses : 30
% 0.21/0.52 # Current number of unprocessed clauses: 43
% 0.21/0.52 # ...number of literals in the above : 102
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 0
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 111
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 108
% 0.21/0.52 # Non-unit clause-clause subsumptions : 0
% 0.21/0.52 # Unit Clause-clause subsumption calls : 19
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 0
% 0.21/0.52 # BW rewrite match successes : 0
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 3782
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.007 s
% 0.21/0.52 # System time : 0.004 s
% 0.21/0.52 # Total time : 0.011 s
% 0.21/0.52 # Maximum resident set size: 2008 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.008 s
% 0.21/0.52 # System time : 0.008 s
% 0.21/0.52 # Total time : 0.016 s
% 0.21/0.52 # Maximum resident set size: 1728 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------