TSTP Solution File: SYN066+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN066+1 : TPTP v8.1.2. Bugfixed v3.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n013.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:27 EDT 2023
% Result : Theorem 0.21s 0.60s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 27 ( 8 unt; 8 typ; 0 def)
% Number of atoms : 36 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 27 ( 10 ~; 8 |; 4 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 7 >; 6 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 42 ( 8 sgn; 17 !; 9 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
big_p: ( $i * $i ) > $o ).
tff(decl_23,type,
big_q: ( $i * $i ) > $o ).
tff(decl_24,type,
big_r: ( $i * $i ) > $o ).
tff(decl_25,type,
esk1_1: $i > $i ).
tff(decl_26,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_27,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_28,type,
esk4_2: ( $i * $i ) > $i ).
tff(decl_29,type,
esk5_0: $i ).
fof(pel37_2,axiom,
! [X3,X1] :
( ~ big_p(X3,X1)
=> ? [X4] : big_q(X4,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel37_2) ).
fof(pel37,conjecture,
! [X3] :
? [X4] : big_r(X3,X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel37) ).
fof(pel37_3,axiom,
( ? [X3,X4] : big_q(X3,X4)
=> ! [X1] : big_r(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel37_3) ).
fof(pel37_1,axiom,
! [X1] :
? [X2] :
! [X3] :
? [X4] :
( ( big_p(X3,X1)
=> big_p(X4,X2) )
& big_p(X4,X1)
& ( big_p(X4,X2)
=> ? [X5] : big_q(X5,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel37_1) ).
fof(c_0_4,plain,
! [X3,X1] :
( ~ big_p(X3,X1)
=> ? [X4] : big_q(X4,X1) ),
inference(fof_simplification,[status(thm)],[pel37_2]) ).
fof(c_0_5,negated_conjecture,
~ ! [X3] :
? [X4] : big_r(X3,X4),
inference(assume_negation,[status(cth)],[pel37]) ).
fof(c_0_6,plain,
! [X14,X15,X16] :
( ~ big_q(X14,X15)
| big_r(X16,X16) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel37_3])])]) ).
fof(c_0_7,plain,
! [X11,X12] :
( big_p(X11,X12)
| big_q(esk4_2(X11,X12),X12) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_8,negated_conjecture,
! [X18] : ~ big_r(esk5_0,X18),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_9,plain,
( big_r(X3,X3)
| ~ big_q(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( big_p(X1,X2)
| big_q(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X6,X8] :
( ( ~ big_p(X8,X6)
| big_p(esk2_2(X6,X8),esk1_1(X6)) )
& big_p(esk2_2(X6,X8),X6)
& ( ~ big_p(esk2_2(X6,X8),esk1_1(X6))
| big_q(esk3_2(X6,X8),esk1_1(X6)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel37_1])])]) ).
cnf(c_0_12,negated_conjecture,
~ big_r(esk5_0,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( big_r(X1,X1)
| big_p(X2,X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( big_q(esk3_2(X1,X2),esk1_1(X1))
| ~ big_p(esk2_2(X1,X2),esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
big_p(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
big_q(esk3_2(X1,X2),esk1_1(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).
cnf(c_0_17,plain,
big_r(X1,X1),
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_12,c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN066+1 : TPTP v8.1.2. Bugfixed v3.0.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n013.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 21:49:47 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.58 start to proof: theBenchmark
% 0.21/0.60 % Version : CSE_E---1.5
% 0.21/0.60 % Problem : theBenchmark.p
% 0.21/0.60 % Proof found
% 0.21/0.60 % SZS status Theorem for theBenchmark.p
% 0.21/0.60 % SZS output start Proof
% See solution above
% 0.21/0.61 % Total time : 0.006000 s
% 0.21/0.61 % SZS output end Proof
% 0.21/0.61 % Total time : 0.009000 s
%------------------------------------------------------------------------------