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