TSTP Solution File: SEU424+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU424+1 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:27 EDT 2023
% Result : Theorem 0.16s 0.44s
% Output : CNFRefutation 0.16s
% 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(t18_relset_2,conjecture,
! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m2_relset_1(X4,X1,X2)
=> m1_subset_1(a_4_0_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.JzoqeXv1iv/E---3.1_3313.p',t18_relset_2) ).
fof(s8_domain_1__e1_22__relset_2,axiom,
! [X1,X2,X3,X4] :
( ( ~ v1_xboole_0(X1)
& m1_subset_1(X3,k1_zfmisc_1(X1))
& m2_relset_1(X4,X1,X2) )
=> m1_subset_1(a_4_0_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))) ),
file('/export/starexec/sandbox/tmp/tmp.JzoqeXv1iv/E---3.1_3313.p',s8_domain_1__e1_22__relset_2) ).
fof(c_0_2,negated_conjecture,
~ ! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m2_relset_1(X4,X1,X2)
=> m1_subset_1(a_4_0_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t18_relset_2])]) ).
fof(c_0_3,plain,
! [X1,X2,X3,X4] :
( ( ~ v1_xboole_0(X1)
& m1_subset_1(X3,k1_zfmisc_1(X1))
& m2_relset_1(X4,X1,X2) )
=> m1_subset_1(a_4_0_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))) ),
inference(fof_simplification,[status(thm)],[s8_domain_1__e1_22__relset_2]) ).
fof(c_0_4,negated_conjecture,
( ~ v1_xboole_0(esk1_0)
& m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0))
& m2_relset_1(esk4_0,esk1_0,esk2_0)
& ~ m1_subset_1(a_4_0_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,
! [X49,X50,X51,X52] :
( v1_xboole_0(X49)
| ~ m1_subset_1(X51,k1_zfmisc_1(X49))
| ~ m2_relset_1(X52,X49,X50)
| m1_subset_1(a_4_0_relset_2(X49,X50,X51,X52),k1_zfmisc_1(k1_zfmisc_1(X50))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
cnf(c_0_6,negated_conjecture,
~ m1_subset_1(a_4_0_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_0_relset_2(X1,X4,X2,X3),k1_zfmisc_1(k1_zfmisc_1(X4)))
| ~ m1_subset_1(X2,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(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.05/0.11 % Problem : SEU424+1 : TPTP v8.1.2. Released v3.4.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n028.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 09:47:06 EDT 2023
% 0.10/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.JzoqeXv1iv/E---3.1_3313.p
% 0.16/0.44 # Version: 3.1pre001
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # sh5l with pid 3394 completed with status 0
% 0.16/0.44 # Result found by sh5l
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.44 # Search class: FGHSM-FFMM32-SFFFFFNN
% 0.16/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting G-E--_301_C18_F1_URBAN_S0Y with 139s (1) cores
% 0.16/0.44 # G-E--_301_C18_F1_URBAN_S0Y with pid 3399 completed with status 0
% 0.16/0.44 # Result found by G-E--_301_C18_F1_URBAN_S0Y
% 0.16/0.44 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.44 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.44 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.44 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.44 # Starting sh5l with 300s (1) cores
% 0.16/0.44 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.44 # Search class: FGHSM-FFMM32-SFFFFFNN
% 0.16/0.44 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44 # Starting G-E--_301_C18_F1_URBAN_S0Y with 139s (1) cores
% 0.16/0.44 # Preprocessing time : 0.002 s
% 0.16/0.44
% 0.16/0.44 # Proof found!
% 0.16/0.44 # SZS status Theorem
% 0.16/0.44 # SZS output start CNFRefutation
% See solution above
% 0.16/0.44 # Parsed axioms : 43
% 0.16/0.44 # Removed by relevancy pruning/SinE : 9
% 0.16/0.44 # Initial clauses : 50
% 0.16/0.44 # Removed in clause preprocessing : 0
% 0.16/0.44 # Initial clauses in saturation : 50
% 0.16/0.44 # Processed clauses : 34
% 0.16/0.44 # ...of these trivial : 2
% 0.16/0.44 # ...subsumed : 0
% 0.16/0.44 # ...remaining for further processing : 32
% 0.16/0.44 # Other redundant clauses eliminated : 0
% 0.16/0.44 # Clauses deleted for lack of memory : 0
% 0.16/0.44 # Backward-subsumed : 0
% 0.16/0.44 # Backward-rewritten : 0
% 0.16/0.44 # Generated clauses : 14
% 0.16/0.44 # ...of the previous two non-redundant : 10
% 0.16/0.44 # ...aggressively subsumed : 0
% 0.16/0.44 # Contextual simplify-reflections : 0
% 0.16/0.44 # Paramodulations : 14
% 0.16/0.44 # Factorizations : 0
% 0.16/0.44 # NegExts : 0
% 0.16/0.44 # Equation resolutions : 0
% 0.16/0.44 # Total rewrite steps : 4
% 0.16/0.44 # Propositional unsat checks : 0
% 0.16/0.44 # Propositional check models : 0
% 0.16/0.44 # Propositional check unsatisfiable : 0
% 0.16/0.44 # Propositional clauses : 0
% 0.16/0.44 # Propositional clauses after purity: 0
% 0.16/0.44 # Propositional unsat core size : 0
% 0.16/0.44 # Propositional preprocessing time : 0.000
% 0.16/0.44 # Propositional encoding time : 0.000
% 0.16/0.44 # Propositional solver time : 0.000
% 0.16/0.44 # Success case prop preproc time : 0.000
% 0.16/0.44 # Success case prop encoding time : 0.000
% 0.16/0.44 # Success case prop solver time : 0.000
% 0.16/0.44 # Current number of processed clauses : 32
% 0.16/0.44 # Positive orientable unit clauses : 13
% 0.16/0.44 # Positive unorientable unit clauses: 0
% 0.16/0.44 # Negative unit clauses : 5
% 0.16/0.44 # Non-unit-clauses : 14
% 0.16/0.44 # Current number of unprocessed clauses: 25
% 0.16/0.44 # ...number of literals in the above : 64
% 0.16/0.44 # Current number of archived formulas : 0
% 0.16/0.44 # Current number of archived clauses : 0
% 0.16/0.44 # Clause-clause subsumption calls (NU) : 7
% 0.16/0.44 # Rec. Clause-clause subsumption calls : 7
% 0.16/0.44 # Non-unit clause-clause subsumptions : 0
% 0.16/0.44 # Unit Clause-clause subsumption calls : 14
% 0.16/0.44 # Rewrite failures with RHS unbound : 0
% 0.16/0.44 # BW rewrite match attempts : 0
% 0.16/0.44 # BW rewrite match successes : 0
% 0.16/0.44 # Condensation attempts : 0
% 0.16/0.44 # Condensation successes : 0
% 0.16/0.44 # Termbank termtop insertions : 2544
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.007 s
% 0.16/0.44 # System time : 0.001 s
% 0.16/0.44 # Total time : 0.009 s
% 0.16/0.44 # Maximum resident set size: 1856 pages
% 0.16/0.44
% 0.16/0.44 # -------------------------------------------------
% 0.16/0.44 # User time : 0.009 s
% 0.16/0.44 # System time : 0.003 s
% 0.16/0.44 # Total time : 0.012 s
% 0.16/0.44 # Maximum resident set size: 1712 pages
% 0.16/0.44 % E---3.1 exiting
% 0.16/0.44 % E---3.1 exiting
%------------------------------------------------------------------------------