TSTP Solution File: SYN385+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN385+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 : n014.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.22s 0.61s
% Output : CNFRefutation 0.22s
% 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 : 12 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 10 ( 4 ~; 2 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 7 ( 1 sgn; 4 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
big_p: $i > $o ).
tff(decl_23,type,
big_q: $i > $o ).
tff(decl_24,type,
esk1_0: $i ).
fof(x2137,conjecture,
? [X1] :
! [X2] :
( big_p(X1)
=> ( big_q(X1)
| big_p(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2137) ).
fof(c_0_1,negated_conjecture,
~ ? [X1] :
! [X2] :
( big_p(X1)
=> ( big_q(X1)
| big_p(X2) ) ),
inference(assume_negation,[status(cth)],[x2137]) ).
fof(c_0_2,negated_conjecture,
! [X3,X4] :
( big_p(X3)
& ~ big_q(X4)
& ~ big_p(esk1_0) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
cnf(c_0_3,negated_conjecture,
~ big_p(esk1_0),
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.13/0.14 % Problem : SYN385+1 : TPTP v8.1.2. Released v2.0.0.
% 0.13/0.15 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.36 % Computer : n014.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sat Aug 26 19:45:02 EDT 2023
% 0.14/0.37 % CPUTime :
% 0.22/0.60 start to proof: theBenchmark
% 0.22/0.61 % Version : CSE_E---1.5
% 0.22/0.61 % Problem : theBenchmark.p
% 0.22/0.61 % Proof found
% 0.22/0.61 % SZS status Theorem for theBenchmark.p
% 0.22/0.61 % SZS output start Proof
% See solution above
% 0.22/0.62 % Total time : 0.003000 s
% 0.22/0.62 % SZS output end Proof
% 0.22/0.62 % Total time : 0.005000 s
%------------------------------------------------------------------------------