TSTP Solution File: SEU429+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU429+1 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:29 EDT 2023
% Result : Theorem 0.18s 0.46s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 5 unt; 0 def)
% Number of atoms : 33 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 34 ( 13 ~; 6 |; 7 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-4 aty)
% Number of variables : 24 ( 0 sgn; 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t28_relset_2,conjecture,
! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> ! [X4] :
( m2_relset_1(X4,X1,X2)
=> m1_subset_1(a_4_1_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.utJGxwmo8U/E---3.1_3582.p',t28_relset_2) ).
fof(s8_domain_1__e1_38__relset_2,axiom,
! [X1,X2,X3,X4] :
( ( ~ v1_xboole_0(X1)
& m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1)))
& m2_relset_1(X4,X1,X2) )
=> m1_subset_1(a_4_1_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))) ),
file('/export/starexec/sandbox2/tmp/tmp.utJGxwmo8U/E---3.1_3582.p',s8_domain_1__e1_38__relset_2) ).
fof(c_0_2,negated_conjecture,
~ ! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> ! [X4] :
( m2_relset_1(X4,X1,X2)
=> m1_subset_1(a_4_1_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t28_relset_2])]) ).
fof(c_0_3,plain,
! [X1,X2,X3,X4] :
( ( ~ v1_xboole_0(X1)
& m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1)))
& m2_relset_1(X4,X1,X2) )
=> m1_subset_1(a_4_1_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))) ),
inference(fof_simplification,[status(thm)],[s8_domain_1__e1_38__relset_2]) ).
fof(c_0_4,negated_conjecture,
( ~ v1_xboole_0(esk1_0)
& m1_subset_1(esk3_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0)))
& m2_relset_1(esk4_0,esk1_0,esk2_0)
& ~ m1_subset_1(a_4_1_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),k1_zfmisc_1(k1_zfmisc_1(esk2_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_5,plain,
! [X41,X42,X43,X44] :
( v1_xboole_0(X41)
| ~ m1_subset_1(X43,k1_zfmisc_1(k1_zfmisc_1(X41)))
| ~ m2_relset_1(X44,X41,X42)
| m1_subset_1(a_4_1_relset_2(X41,X42,X43,X44),k1_zfmisc_1(k1_zfmisc_1(X42))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
cnf(c_0_6,negated_conjecture,
~ m1_subset_1(a_4_1_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),k1_zfmisc_1(k1_zfmisc_1(esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( v1_xboole_0(X1)
| m1_subset_1(a_4_1_relset_2(X1,X4,X2,X3),k1_zfmisc_1(k1_zfmisc_1(X4)))
| ~ m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
| ~ m2_relset_1(X3,X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
m2_relset_1(esk4_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
~ v1_xboole_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_9])]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU429+1 : TPTP v8.1.2. Released v3.4.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n029.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 2400
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon Oct 2 09:42:51 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.45 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.utJGxwmo8U/E---3.1_3582.p
% 0.18/0.46 # Version: 3.1pre001
% 0.18/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.46 # Starting sh5l with 300s (1) cores
% 0.18/0.46 # sh5l with pid 3663 completed with status 0
% 0.18/0.46 # Result found by sh5l
% 0.18/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.46 # Starting sh5l with 300s (1) cores
% 0.18/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.46 # Search class: FGHSM-FFMM32-MFFFFFNN
% 0.18/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.18/0.46 # G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with pid 3668 completed with status 0
% 0.18/0.46 # Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0Y
% 0.18/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.46 # Starting sh5l with 300s (1) cores
% 0.18/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.46 # Search class: FGHSM-FFMM32-MFFFFFNN
% 0.18/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.18/0.46 # Preprocessing time : 0.001 s
% 0.18/0.46
% 0.18/0.46 # Proof found!
% 0.18/0.46 # SZS status Theorem
% 0.18/0.46 # SZS output start CNFRefutation
% See solution above
% 0.18/0.46 # Parsed axioms : 51
% 0.18/0.46 # Removed by relevancy pruning/SinE : 11
% 0.18/0.46 # Initial clauses : 61
% 0.18/0.46 # Removed in clause preprocessing : 0
% 0.18/0.46 # Initial clauses in saturation : 61
% 0.18/0.46 # Processed clauses : 56
% 0.18/0.46 # ...of these trivial : 2
% 0.18/0.46 # ...subsumed : 0
% 0.18/0.46 # ...remaining for further processing : 54
% 0.18/0.46 # Other redundant clauses eliminated : 0
% 0.18/0.46 # Clauses deleted for lack of memory : 0
% 0.18/0.46 # Backward-subsumed : 0
% 0.18/0.46 # Backward-rewritten : 0
% 0.18/0.46 # Generated clauses : 50
% 0.18/0.46 # ...of the previous two non-redundant : 42
% 0.18/0.46 # ...aggressively subsumed : 0
% 0.18/0.46 # Contextual simplify-reflections : 0
% 0.18/0.46 # Paramodulations : 48
% 0.18/0.46 # Factorizations : 2
% 0.18/0.46 # NegExts : 0
% 0.18/0.46 # Equation resolutions : 0
% 0.18/0.46 # Total rewrite steps : 4
% 0.18/0.46 # Propositional unsat checks : 0
% 0.18/0.46 # Propositional check models : 0
% 0.18/0.46 # Propositional check unsatisfiable : 0
% 0.18/0.46 # Propositional clauses : 0
% 0.18/0.46 # Propositional clauses after purity: 0
% 0.18/0.46 # Propositional unsat core size : 0
% 0.18/0.46 # Propositional preprocessing time : 0.000
% 0.18/0.46 # Propositional encoding time : 0.000
% 0.18/0.46 # Propositional solver time : 0.000
% 0.18/0.46 # Success case prop preproc time : 0.000
% 0.18/0.46 # Success case prop encoding time : 0.000
% 0.18/0.46 # Success case prop solver time : 0.000
% 0.18/0.46 # Current number of processed clauses : 54
% 0.18/0.46 # Positive orientable unit clauses : 20
% 0.18/0.46 # Positive unorientable unit clauses: 0
% 0.18/0.46 # Negative unit clauses : 4
% 0.18/0.46 # Non-unit-clauses : 30
% 0.18/0.46 # Current number of unprocessed clauses: 45
% 0.18/0.46 # ...number of literals in the above : 116
% 0.18/0.46 # Current number of archived formulas : 0
% 0.18/0.46 # Current number of archived clauses : 0
% 0.18/0.46 # Clause-clause subsumption calls (NU) : 90
% 0.18/0.46 # Rec. Clause-clause subsumption calls : 72
% 0.18/0.46 # Non-unit clause-clause subsumptions : 0
% 0.18/0.46 # Unit Clause-clause subsumption calls : 5
% 0.18/0.46 # Rewrite failures with RHS unbound : 0
% 0.18/0.46 # BW rewrite match attempts : 0
% 0.18/0.46 # BW rewrite match successes : 0
% 0.18/0.46 # Condensation attempts : 0
% 0.18/0.46 # Condensation successes : 0
% 0.18/0.46 # Termbank termtop insertions : 3746
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.007 s
% 0.18/0.46 # System time : 0.001 s
% 0.18/0.46 # Total time : 0.008 s
% 0.18/0.46 # Maximum resident set size: 1892 pages
% 0.18/0.46
% 0.18/0.46 # -------------------------------------------------
% 0.18/0.46 # User time : 0.009 s
% 0.18/0.46 # System time : 0.002 s
% 0.18/0.46 # Total time : 0.012 s
% 0.18/0.46 # Maximum resident set size: 1732 pages
% 0.18/0.46 % E---3.1 exiting
% 0.18/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------