%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : SYN040+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n011.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 : 300s
% DateTime : Thu May 9 17:47:08 EDT 2024
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 4 unt; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 57 ( 24 ~; 17 |; 7 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 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(pel1,conjecture,
( ( p
=> q )
<=> ( ~ q
=> ~ p ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel1) ).
fof(c0,negated_conjecture,
~ ( ( p
=> q )
<=> ( ~ q
=> ~ p ) ),
inference(assume_negation,[status(cth)],[pel1]) ).
fof(c1,negated_conjecture,
~ ( ( p
=> q )
<=> ( ~ q
=> ~ p ) ),
inference(fof_simplification,[status(thm)],[c0]) ).
fof(c2,negated_conjecture,
( ( ( p
& ~ q )
| ( ~ q
& p ) )
& ( ~ p
| q
| q
| ~ p ) ),
inference(fof_nnf,[status(thm)],[c1]) ).
fof(c3,negated_conjecture,
( ( p
| ~ q )
& ( p
| p )
& ( ~ q
| ~ q )
& ( ~ q
| p )
& ( ~ p
| q
| q
| ~ p ) ),
inference(distribute,[status(thm)],[c2]) ).
cnf(c6,negated_conjecture,
( ~ q
| ~ q ),
inference(split_conjunct,[status(thm)],[c3]) ).
cnf(c10,plain,
~ q,
inference(factor,[status(thm)],[c6]) ).
cnf(c5,negated_conjecture,
( p
| p ),
inference(split_conjunct,[status(thm)],[c3]) ).
cnf(c9,plain,
p,
inference(factor,[status(thm)],[c5]) ).
cnf(c8,negated_conjecture,
( ~ p
| q
| q
| ~ p ),
inference(split_conjunct,[status(thm)],[c3]) ).
cnf(c11,plain,
( ~ p
| q ),
inference(factor,[status(thm)],[c8]) ).
cnf(c13,plain,
q,
inference(resolution,[status(thm)],[c11,c9]) ).
cnf(c14,plain,
$false,
inference(resolution,[status(thm)],[c13,c10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN040+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.14/0.34 % Computer : n011.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed May 8 19:55:38 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.52 % Version: 1.5
% 0.20/0.52 % SZS status Theorem
% 0.20/0.52 % SZS output start CNFRefutation
% See solution above
% 0.20/0.52
% 0.20/0.52 % Initial clauses : 5
% 0.20/0.52 % Processed clauses : 8
% 0.20/0.52 % Factors computed : 3
% 0.20/0.52 % Resolvents computed: 3
% 0.20/0.52 % Tautologies deleted: 0
% 0.20/0.52 % Forward subsumed : 1
% 0.20/0.52 % Backward subsumed : 5
% 0.20/0.52 % -------- CPU Time ---------
% 0.20/0.52 % User time : 0.161 s
% 0.20/0.52 % System time : 0.018 s
% 0.20/0.52 % Total time : 0.179 s
%------------------------------------------------------------------------------