TSTP Solution File: SYN060+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SYN060+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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 : Thu Jul 21 05:51:23 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 7 unt; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 29 ( 11 ~; 10 |; 5 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 9 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel30,conjecture,
! [X1] : big_i(X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel30) ).
fof(pel30_2,axiom,
! [X1] :
( ( big_g(X1)
=> ~ big_i(X1) )
=> ( big_f(X1)
& big_h(X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel30_2) ).
fof(pel30_1,axiom,
! [X1] :
( ( big_f(X1)
| big_g(X1) )
=> ~ big_h(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel30_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] : big_i(X1),
inference(assume_negation,[status(cth)],[pel30]) ).
fof(c_0_4,negated_conjecture,
~ big_i(esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X2] :
( ( big_f(X2)
| big_g(X2) )
& ( big_h(X2)
| big_g(X2) )
& ( big_f(X2)
| big_i(X2) )
& ( big_h(X2)
| big_i(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[pel30_2])])])]) ).
fof(c_0_6,plain,
! [X2] :
( ( ~ big_f(X2)
| ~ big_h(X2) )
& ( ~ big_g(X2)
| ~ big_h(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[pel30_1])])])]) ).
cnf(c_0_7,negated_conjecture,
~ big_i(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( big_i(X1)
| big_f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( big_i(X1)
| big_h(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( ~ big_h(X1)
| ~ big_f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
big_f(esk1_0),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
big_h(esk1_0),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN060+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n010.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jul 12 06:00:15 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.014 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 14
% 0.22/1.40 # Proof object clause steps : 7
% 0.22/1.40 # Proof object formula steps : 7
% 0.22/1.40 # Proof object conjectures : 7
% 0.22/1.40 # Proof object clause conjectures : 4
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 4
% 0.22/1.40 # Proof object initial formulas used : 3
% 0.22/1.40 # Proof object generating inferences : 3
% 0.22/1.40 # Proof object simplifying inferences : 2
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 3
% 0.22/1.40 # Removed by relevancy pruning/SinE : 0
% 0.22/1.40 # Initial clauses : 7
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 7
% 0.22/1.40 # Processed clauses : 11
% 0.22/1.40 # ...of these trivial : 0
% 0.22/1.40 # ...subsumed : 0
% 0.22/1.40 # ...remaining for further processing : 10
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 1
% 0.22/1.40 # Backward-rewritten : 2
% 0.22/1.40 # Generated clauses : 5
% 0.22/1.40 # ...of the previous two non-trivial : 5
% 0.22/1.40 # Contextual simplify-reflections : 1
% 0.22/1.40 # Paramodulations : 5
% 0.22/1.40 # Factorizations : 0
% 0.22/1.40 # Equation resolutions : 0
% 0.22/1.40 # Current number of processed clauses : 7
% 0.22/1.40 # Positive orientable unit clauses : 3
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 1
% 0.22/1.40 # Non-unit-clauses : 3
% 0.22/1.40 # Current number of unprocessed clauses: 1
% 0.22/1.40 # ...number of literals in the above : 1
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 3
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 1
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 1
% 0.22/1.40 # Non-unit clause-clause subsumptions : 1
% 0.22/1.41 # Unit Clause-clause subsumption calls : 3
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 1
% 0.22/1.41 # BW rewrite match successes : 1
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 273
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.013 s
% 0.22/1.41 # System time : 0.001 s
% 0.22/1.41 # Total time : 0.014 s
% 0.22/1.41 # Maximum resident set size: 2760 pages
%------------------------------------------------------------------------------