TSTP Solution File: SYN381+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN381+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 : n031.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:30 EDT 2023
% Result : Theorem 0.20s 0.59s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 14 ( 4 unt; 4 typ; 0 def)
% Number of atoms : 32 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 29 ( 7 ~; 9 |; 7 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 26 ( 2 sgn; 15 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
big_q: ( $i * $i ) > $o ).
tff(decl_23,type,
big_p: $i > $o ).
tff(decl_24,type,
esk1_1: $i > $i ).
tff(decl_25,type,
esk2_0: $i ).
fof(x2133,conjecture,
( ( ! [X1] :
( ? [X2] : big_q(X1,X2)
=> big_p(X1) )
& ! [X3] :
? [X4] : big_q(X4,X3)
& ! [X5,X6] :
( big_q(X5,X6)
=> ( big_q(X6,X5)
| big_q(X6,X6) ) ) )
=> ! [X6] : big_p(X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2133) ).
fof(c_0_1,negated_conjecture,
~ ( ( ! [X1] :
( ? [X2] : big_q(X1,X2)
=> big_p(X1) )
& ! [X3] :
? [X4] : big_q(X4,X3)
& ! [X5,X6] :
( big_q(X5,X6)
=> ( big_q(X6,X5)
| big_q(X6,X6) ) ) )
=> ! [X6] : big_p(X6) ),
inference(assume_negation,[status(cth)],[x2133]) ).
fof(c_0_2,negated_conjecture,
! [X7,X8,X9,X11,X12] :
( ( ~ big_q(X7,X8)
| big_p(X7) )
& big_q(esk1_1(X9),X9)
& ( ~ big_q(X11,X12)
| big_q(X12,X11)
| big_q(X12,X12) )
& ~ big_p(esk2_0) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).
cnf(c_0_3,negated_conjecture,
( big_q(X2,X1)
| big_q(X2,X2)
| ~ big_q(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
big_q(esk1_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( big_p(X1)
| ~ big_q(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( big_q(X1,esk1_1(X1))
| big_q(X1,X1) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
~ big_p(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
big_p(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_5]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SYN381+1 : TPTP v8.1.2. Released v2.0.0.
% 0.11/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34 % Computer : n031.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.35 % DateTime : Sat Aug 26 19:43:23 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.58 start to proof: theBenchmark
% 0.20/0.59 % Version : CSE_E---1.5
% 0.20/0.59 % Problem : theBenchmark.p
% 0.20/0.59 % Proof found
% 0.20/0.59 % SZS status Theorem for theBenchmark.p
% 0.20/0.59 % SZS output start Proof
% See solution above
% 0.20/0.59 % Total time : 0.004000 s
% 0.20/0.59 % SZS output end Proof
% 0.20/0.59 % Total time : 0.006000 s
%------------------------------------------------------------------------------