TSTP Solution File: SYN383+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN383+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n012.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:51:31 EDT 2023
% Result : Theorem 0.18s 0.57s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 9 ( 3 unt; 3 typ; 0 def)
% Number of atoms : 15 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 13 ( 4 ~; 2 |; 5 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 7 ( 2 sgn; 3 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
big_p: $i > $o ).
tff(decl_23,type,
big_q: $i > $o ).
tff(decl_24,type,
esk1_1: $i > $i ).
fof(x2135,conjecture,
? [X1] :
! [X2] :
( ( big_p(X1)
& big_q(X2) )
=> ( big_q(X1)
| big_p(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2135) ).
fof(c_0_1,negated_conjecture,
~ ? [X1] :
! [X2] :
( ( big_p(X1)
& big_q(X2) )
=> ( big_q(X1)
| big_p(X2) ) ),
inference(assume_negation,[status(cth)],[x2135]) ).
fof(c_0_2,negated_conjecture,
! [X3] :
( big_p(X3)
& big_q(esk1_1(X3))
& ~ big_q(X3)
& ~ big_p(esk1_1(X3)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])]) ).
cnf(c_0_3,negated_conjecture,
~ big_p(esk1_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
big_p(X1),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN383+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n012.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 : 300
% 0.12/0.33 % DateTime : Sat Aug 26 17:24:56 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.18/0.56 start to proof: theBenchmark
% 0.18/0.57 % Version : CSE_E---1.5
% 0.18/0.57 % Problem : theBenchmark.p
% 0.18/0.57 % Proof found
% 0.18/0.57 % SZS status Theorem for theBenchmark.p
% 0.18/0.57 % SZS output start Proof
% See solution above
% 0.18/0.57 % Total time : 0.003000 s
% 0.18/0.57 % SZS output end Proof
% 0.18/0.57 % Total time : 0.006000 s
%------------------------------------------------------------------------------