TSTP Solution File: SYN047+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN047+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n024.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 : Fri Sep 1 01:49:17 EDT 2023
% Result : Theorem 0.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 5 unt; 4 typ; 0 def)
% Number of atoms : 169 ( 0 equ)
% Maximal formula atoms : 114 ( 10 avg)
% Number of connectives : 234 ( 81 ~; 113 |; 34 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 6 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 5 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
p: $o ).
tff(decl_23,type,
q: $o ).
tff(decl_24,type,
r: $o ).
tff(decl_25,type,
s: $o ).
fof(pel17,conjecture,
( ( ( p
& ( q
=> r ) )
=> s )
<=> ( ( ~ p
| q
| s )
& ( ~ p
| ~ r
| s ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel17) ).
fof(c_0_1,negated_conjecture,
~ ( ( ( p
& ( q
=> r ) )
=> s )
<=> ( ( ~ p
| q
| s )
& ( ~ p
| ~ r
| s ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[pel17])]) ).
fof(c_0_2,negated_conjecture,
( ( p
| p
| p )
& ( r
| p
| p )
& ( ~ s
| p
| p )
& ( p
| ~ q
| p )
& ( r
| ~ q
| p )
& ( ~ s
| ~ q
| p )
& ( p
| ~ s
| p )
& ( r
| ~ s
| p )
& ( ~ s
| ~ s
| p )
& ( p
| p
| ~ q
| r )
& ( r
| p
| ~ q
| r )
& ( ~ s
| p
| ~ q
| r )
& ( p
| ~ q
| ~ q
| r )
& ( r
| ~ q
| ~ q
| r )
& ( ~ s
| ~ q
| ~ q
| r )
& ( p
| ~ s
| ~ q
| r )
& ( r
| ~ s
| ~ q
| r )
& ( ~ s
| ~ s
| ~ q
| r )
& ( p
| p
| ~ s )
& ( r
| p
| ~ s )
& ( ~ s
| p
| ~ s )
& ( p
| ~ q
| ~ s )
& ( r
| ~ q
| ~ s )
& ( ~ s
| ~ q
| ~ s )
& ( p
| ~ s
| ~ s )
& ( r
| ~ s
| ~ s )
& ( ~ s
| ~ s
| ~ s )
& ( ~ p
| q
| s
| q
| ~ p
| s )
& ( ~ p
| ~ r
| s
| q
| ~ p
| s )
& ( ~ p
| q
| s
| ~ r
| ~ p
| s )
& ( ~ p
| ~ r
| s
| ~ r
| ~ p
| s ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])]) ).
cnf(c_0_3,negated_conjecture,
( q
| s
| q
| s
| ~ p
| ~ p ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( p
| p
| p ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( ~ s
| ~ s
| ~ s ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( s
| s
| ~ p
| ~ r
| ~ r
| ~ p ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
( r
| r
| ~ q
| ~ q ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
( q
| s
| ~ p ),
inference(cn,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
p,
inference(cn,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
~ s,
inference(cn,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
( s
| ~ p
| ~ r ),
inference(cn,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( r
| ~ q ),
inference(cn,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
q,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]),c_0_10]) ).
cnf(c_0_14,negated_conjecture,
~ r,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_9])]),c_0_10]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN047+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat Aug 26 21:31:23 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 0.19/0.58 % Version : CSE_E---1.5
% 0.19/0.58 % Problem : theBenchmark.p
% 0.19/0.58 % Proof found
% 0.19/0.58 % SZS status Theorem for theBenchmark.p
% 0.19/0.58 % SZS output start Proof
% See solution above
% 0.19/0.58 % Total time : 0.003000 s
% 0.19/0.58 % SZS output end Proof
% 0.19/0.58 % Total time : 0.006000 s
%------------------------------------------------------------------------------