TSTP Solution File: SEU429+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU429+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.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 : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 09:20:05 EDT 2022
% Result : Theorem 0.26s 1.43s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 11 ( 5 unt; 0 def)
% Number of atoms : 29 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 30 ( 12 ~; 6 |; 5 &)
% ( 0 <=>; 7 =>; 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 : 20 ( 0 sgn 16 !; 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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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(assume_negation,[status(cth)],[t28_relset_2]) ).
fof(c_0_3,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(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2])])])])])]) ).
fof(c_0_4,plain,
! [X5,X6,X7,X8] :
( v1_xboole_0(X5)
| ~ m1_subset_1(X7,k1_zfmisc_1(k1_zfmisc_1(X5)))
| ~ m2_relset_1(X8,X5,X6)
| m1_subset_1(a_4_1_relset_2(X5,X6,X7,X8),k1_zfmisc_1(k1_zfmisc_1(X6))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[s8_domain_1__e1_38__relset_2])])]) ).
cnf(c_0_5,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_3]) ).
cnf(c_0_6,plain,
( m1_subset_1(a_4_1_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2)))
| v1_xboole_0(X1)
| ~ m2_relset_1(X4,X1,X2)
| ~ m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
m2_relset_1(esk4_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
~ v1_xboole_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,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_5,c_0_6]),c_0_7]),c_0_8])]),c_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU429+1 : TPTP v8.1.0. Released v3.4.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 20 10:13:30 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.26/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.43 # Preprocessing time : 0.017 s
% 0.26/1.43
% 0.26/1.43 # Proof found!
% 0.26/1.43 # SZS status Theorem
% 0.26/1.43 # SZS output start CNFRefutation
% See solution above
% 0.26/1.43 # Proof object total steps : 11
% 0.26/1.43 # Proof object clause steps : 6
% 0.26/1.43 # Proof object formula steps : 5
% 0.26/1.43 # Proof object conjectures : 8
% 0.26/1.43 # Proof object clause conjectures : 5
% 0.26/1.43 # Proof object formula conjectures : 3
% 0.26/1.43 # Proof object initial clauses used : 5
% 0.26/1.43 # Proof object initial formulas used : 2
% 0.26/1.43 # Proof object generating inferences : 1
% 0.26/1.43 # Proof object simplifying inferences : 4
% 0.26/1.43 # Training examples: 0 positive, 0 negative
% 0.26/1.43 # Parsed axioms : 51
% 0.26/1.43 # Removed by relevancy pruning/SinE : 27
% 0.26/1.43 # Initial clauses : 35
% 0.26/1.43 # Removed in clause preprocessing : 0
% 0.26/1.43 # Initial clauses in saturation : 35
% 0.26/1.43 # Processed clauses : 28
% 0.26/1.43 # ...of these trivial : 0
% 0.26/1.43 # ...subsumed : 0
% 0.26/1.43 # ...remaining for further processing : 28
% 0.26/1.43 # Other redundant clauses eliminated : 0
% 0.26/1.43 # Clauses deleted for lack of memory : 0
% 0.26/1.43 # Backward-subsumed : 0
% 0.26/1.43 # Backward-rewritten : 0
% 0.26/1.43 # Generated clauses : 21
% 0.26/1.43 # ...of the previous two non-trivial : 17
% 0.26/1.43 # Contextual simplify-reflections : 0
% 0.26/1.43 # Paramodulations : 21
% 0.26/1.43 # Factorizations : 0
% 0.26/1.43 # Equation resolutions : 0
% 0.26/1.43 # Current number of processed clauses : 28
% 0.26/1.43 # Positive orientable unit clauses : 10
% 0.26/1.43 # Positive unorientable unit clauses: 0
% 0.26/1.43 # Negative unit clauses : 4
% 0.26/1.43 # Non-unit-clauses : 14
% 0.26/1.43 # Current number of unprocessed clauses: 24
% 0.26/1.43 # ...number of literals in the above : 69
% 0.26/1.43 # Current number of archived formulas : 0
% 0.26/1.43 # Current number of archived clauses : 0
% 0.26/1.43 # Clause-clause subsumption calls (NU) : 14
% 0.26/1.43 # Rec. Clause-clause subsumption calls : 11
% 0.26/1.43 # Non-unit clause-clause subsumptions : 0
% 0.26/1.43 # Unit Clause-clause subsumption calls : 7
% 0.26/1.43 # Rewrite failures with RHS unbound : 0
% 0.26/1.43 # BW rewrite match attempts : 0
% 0.26/1.43 # BW rewrite match successes : 0
% 0.26/1.43 # Condensation attempts : 0
% 0.26/1.43 # Condensation successes : 0
% 0.26/1.43 # Termbank termtop insertions : 2549
% 0.26/1.43
% 0.26/1.43 # -------------------------------------------------
% 0.26/1.43 # User time : 0.016 s
% 0.26/1.43 # System time : 0.002 s
% 0.26/1.43 # Total time : 0.018 s
% 0.26/1.43 # Maximum resident set size: 3052 pages
%------------------------------------------------------------------------------