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