TSTP Solution File: SYN058+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN058+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 : n017.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:23 EDT 2023
% Result : Theorem 0.20s 0.56s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of formulae : 28 ( 6 unt; 9 typ; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 42 ( 15 ~; 13 |; 8 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 18 ( 4 sgn; 10 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
big_p: $i > $o ).
tff(decl_23,type,
big_q: $i > $o ).
tff(decl_24,type,
big_r: $i > $o ).
tff(decl_25,type,
big_s: $i > $o ).
tff(decl_26,type,
big_f: $i > $o ).
tff(decl_27,type,
big_g: $i > $o ).
tff(decl_28,type,
esk1_0: $i ).
tff(decl_29,type,
esk2_0: $i ).
tff(decl_30,type,
esk3_0: $i ).
fof(pel28,conjecture,
! [X1] :
( ( big_p(X1)
& big_f(X1) )
=> big_g(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel28) ).
fof(pel28_1,axiom,
! [X1] :
( big_p(X1)
=> ! [X2] : big_q(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel28_1) ).
fof(pel28_2,axiom,
( ! [X1] :
( big_q(X1)
| big_r(X1) )
=> ? [X3] :
( big_q(X3)
& big_s(X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel28_2) ).
fof(pel28_3,axiom,
( ? [X1] : big_s(X1)
=> ! [X3] :
( big_f(X3)
=> big_g(X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel28_3) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ( big_p(X1)
& big_f(X1) )
=> big_g(X1) ),
inference(assume_negation,[status(cth)],[pel28]) ).
fof(c_0_5,plain,
! [X4,X5] :
( ~ big_p(X4)
| big_q(X5) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel28_1])])]) ).
fof(c_0_6,negated_conjecture,
( big_p(esk3_0)
& big_f(esk3_0)
& ~ big_g(esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
( ( big_q(esk2_0)
| ~ big_q(esk1_0) )
& ( big_s(esk2_0)
| ~ big_q(esk1_0) )
& ( big_q(esk2_0)
| ~ big_r(esk1_0) )
& ( big_s(esk2_0)
| ~ big_r(esk1_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel28_2])])])]) ).
cnf(c_0_8,plain,
( big_q(X2)
| ~ big_p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
big_p(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X8,X9] :
( ~ big_s(X8)
| ~ big_f(X9)
| big_g(X9) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel28_3])])]) ).
cnf(c_0_11,plain,
( big_s(esk2_0)
| ~ big_q(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
big_q(X1),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( big_g(X2)
| ~ big_s(X1)
| ~ big_f(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
big_s(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12])]) ).
cnf(c_0_15,negated_conjecture,
~ big_g(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,plain,
( big_g(X1)
| ~ big_f(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
big_f(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN058+1 : TPTP v8.1.2. Released v2.0.0.
% 0.11/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.33 % Computer : n017.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Sat Aug 26 20:27:41 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.55 start to proof: theBenchmark
% 0.20/0.56 % Version : CSE_E---1.5
% 0.20/0.56 % Problem : theBenchmark.p
% 0.20/0.56 % Proof found
% 0.20/0.56 % SZS status Theorem for theBenchmark.p
% 0.20/0.56 % SZS output start Proof
% See solution above
% 0.20/0.57 % Total time : 0.004000 s
% 0.20/0.57 % SZS output end Proof
% 0.20/0.57 % Total time : 0.006000 s
%------------------------------------------------------------------------------