TSTP Solution File: SEU424+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU424+3 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:32:06 EDT 2023
% Result : Theorem 1.80s 2.31s
% Output : CNFRefutation 1.80s
% 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/sandbox2/tmp/tmp.VdOLuvrPYo/E---3.1_27763.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/sandbox2/tmp/tmp.VdOLuvrPYo/E---3.1_27763.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,
! [X43,X44,X45,X46] :
( v1_xboole_0(X43)
| ~ m1_subset_1(X45,k1_zfmisc_1(X43))
| ~ m2_relset_1(X46,X43,X44)
| m1_subset_1(a_4_0_relset_2(X43,X44,X45,X46),k1_zfmisc_1(k1_zfmisc_1(X44))) ),
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.07/0.12 % Problem : SEU424+3 : TPTP v8.1.2. Released v3.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 09:17:12 EDT 2023
% 0.13/0.35 % CPUTime :
% 1.36/1.59 Running first-order model finding
% 1.36/1.59 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.VdOLuvrPYo/E---3.1_27763.p
% 1.80/2.31 # Version: 3.1pre001
% 1.80/2.31 # Preprocessing class: FMLLMMLLSSSNFFN.
% 1.80/2.31 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.80/2.31 # Starting new_bool_3 with 900s (3) cores
% 1.80/2.31 # Starting new_bool_1 with 900s (3) cores
% 1.80/2.31 # Starting sh5l with 300s (1) cores
% 1.80/2.31 # Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 1.80/2.31 # G-E--_211_C18_F1_AE_CS_SP_S0Y with pid 27843 completed with status 0
% 1.80/2.31 # Result found by G-E--_211_C18_F1_AE_CS_SP_S0Y
% 1.80/2.31 # Preprocessing class: FMLLMMLLSSSNFFN.
% 1.80/2.31 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.80/2.31 # Starting new_bool_3 with 900s (3) cores
% 1.80/2.31 # Starting new_bool_1 with 900s (3) cores
% 1.80/2.31 # Starting sh5l with 300s (1) cores
% 1.80/2.31 # Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 1.80/2.31 # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 1.80/2.31 # Search class: FGHSM-FSLM32-DFFFFFNN
% 1.80/2.31 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1.80/2.31 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 1.80/2.31 # G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 27850 completed with status 0
% 1.80/2.31 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 1.80/2.31 # Preprocessing class: FMLLMMLLSSSNFFN.
% 1.80/2.31 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.80/2.31 # Starting new_bool_3 with 900s (3) cores
% 1.80/2.31 # Starting new_bool_1 with 900s (3) cores
% 1.80/2.31 # Starting sh5l with 300s (1) cores
% 1.80/2.31 # Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 1.80/2.31 # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 1.80/2.31 # Search class: FGHSM-FSLM32-DFFFFFNN
% 1.80/2.31 # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1.80/2.31 # Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 23s (1) cores
% 1.80/2.31 # Preprocessing time : 0.035 s
% 1.80/2.31
% 1.80/2.31 # Proof found!
% 1.80/2.31 # SZS status Theorem
% 1.80/2.31 # SZS output start CNFRefutation
% See solution above
% 1.80/2.31 # Parsed axioms : 19089
% 1.80/2.31 # Removed by relevancy pruning/SinE : 18588
% 1.80/2.31 # Initial clauses : 908
% 1.80/2.31 # Removed in clause preprocessing : 23
% 1.80/2.31 # Initial clauses in saturation : 885
% 1.80/2.31 # Processed clauses : 225
% 1.80/2.31 # ...of these trivial : 10
% 1.80/2.31 # ...subsumed : 13
% 1.80/2.31 # ...remaining for further processing : 202
% 1.80/2.31 # Other redundant clauses eliminated : 3
% 1.80/2.31 # Clauses deleted for lack of memory : 0
% 1.80/2.31 # Backward-subsumed : 0
% 1.80/2.31 # Backward-rewritten : 1
% 1.80/2.31 # Generated clauses : 473
% 1.80/2.31 # ...of the previous two non-redundant : 394
% 1.80/2.31 # ...aggressively subsumed : 0
% 1.80/2.31 # Contextual simplify-reflections : 1
% 1.80/2.31 # Paramodulations : 464
% 1.80/2.31 # Factorizations : 0
% 1.80/2.31 # NegExts : 0
% 1.80/2.31 # Equation resolutions : 9
% 1.80/2.31 # Total rewrite steps : 47
% 1.80/2.31 # Propositional unsat checks : 0
% 1.80/2.31 # Propositional check models : 0
% 1.80/2.31 # Propositional check unsatisfiable : 0
% 1.80/2.31 # Propositional clauses : 0
% 1.80/2.31 # Propositional clauses after purity: 0
% 1.80/2.31 # Propositional unsat core size : 0
% 1.80/2.31 # Propositional preprocessing time : 0.000
% 1.80/2.31 # Propositional encoding time : 0.000
% 1.80/2.31 # Propositional solver time : 0.000
% 1.80/2.31 # Success case prop preproc time : 0.000
% 1.80/2.31 # Success case prop encoding time : 0.000
% 1.80/2.31 # Success case prop solver time : 0.000
% 1.80/2.31 # Current number of processed clauses : 198
% 1.80/2.31 # Positive orientable unit clauses : 47
% 1.80/2.31 # Positive unorientable unit clauses: 2
% 1.80/2.31 # Negative unit clauses : 11
% 1.80/2.31 # Non-unit-clauses : 138
% 1.80/2.31 # Current number of unprocessed clauses: 1048
% 1.80/2.31 # ...number of literals in the above : 3378
% 1.80/2.31 # Current number of archived formulas : 0
% 1.80/2.31 # Current number of archived clauses : 4
% 1.80/2.31 # Clause-clause subsumption calls (NU) : 6733
% 1.80/2.31 # Rec. Clause-clause subsumption calls : 4791
% 1.80/2.31 # Non-unit clause-clause subsumptions : 9
% 1.80/2.31 # Unit Clause-clause subsumption calls : 276
% 1.80/2.31 # Rewrite failures with RHS unbound : 0
% 1.80/2.31 # BW rewrite match attempts : 36
% 1.80/2.31 # BW rewrite match successes : 29
% 1.80/2.31 # Condensation attempts : 0
% 1.80/2.31 # Condensation successes : 0
% 1.80/2.31 # Termbank termtop insertions : 601336
% 1.80/2.31
% 1.80/2.31 # -------------------------------------------------
% 1.80/2.31 # User time : 0.230 s
% 1.80/2.31 # System time : 0.059 s
% 1.80/2.31 # Total time : 0.289 s
% 1.80/2.31 # Maximum resident set size: 38700 pages
% 1.80/2.31
% 1.80/2.31 # -------------------------------------------------
% 1.80/2.31 # User time : 0.598 s
% 1.80/2.31 # System time : 0.078 s
% 1.80/2.31 # Total time : 0.676 s
% 1.80/2.31 # Maximum resident set size: 29704 pages
% 1.80/2.31 % E---3.1 exiting
%------------------------------------------------------------------------------