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