TSTP Solution File: SYN326+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN326+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 : n026.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:08 EDT 2023
% Result : Theorem 0.20s 0.59s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 15 ( 4 unt; 5 typ; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 38 ( 8 ~; 8 |; 6 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 5 >; 1 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 13 ( 1 sgn; 5 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
big_f: ( $i * $i ) > $o ).
tff(decl_23,type,
big_g: $i > $o ).
tff(decl_24,type,
big_h: $i > $o ).
tff(decl_25,type,
esk1_1: $i > $i ).
tff(decl_26,type,
esk2_1: $i > $i ).
fof(church_46_12_1,conjecture,
? [X1] :
! [X2,X3] :
( ( ( big_f(X2,X3)
=> ( big_g(X2)
=> big_h(X1) ) )
=> big_f(X1,X1) )
=> ( ( ( big_f(X3,X1)
=> big_g(X1) )
=> big_h(X3) )
=> ( big_f(X1,X2)
=> big_f(X3,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_12_1) ).
fof(c_0_1,negated_conjecture,
~ ? [X1] :
! [X2,X3] :
( ( ( big_f(X2,X3)
=> ( big_g(X2)
=> big_h(X1) ) )
=> big_f(X1,X1) )
=> ( ( ( big_f(X3,X1)
=> big_g(X1) )
=> big_h(X3) )
=> ( big_f(X1,X2)
=> big_f(X3,X3) ) ) ),
inference(assume_negation,[status(cth)],[church_46_12_1]) ).
fof(c_0_2,negated_conjecture,
! [X4] :
( ( big_f(esk1_1(X4),esk2_1(X4))
| big_f(X4,X4) )
& ( big_g(esk1_1(X4))
| big_f(X4,X4) )
& ( ~ big_h(X4)
| big_f(X4,X4) )
& ( big_f(esk2_1(X4),X4)
| big_h(esk2_1(X4)) )
& ( ~ big_g(X4)
| big_h(esk2_1(X4)) )
& big_f(X4,esk1_1(X4))
& ~ big_f(esk2_1(X4),esk2_1(X4)) ),
inference(distribute,[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_f(X1,X1)
| ~ big_h(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( big_h(esk2_1(X1))
| ~ big_g(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
~ big_f(esk2_1(X1),esk2_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( big_g(esk1_1(X1))
| big_f(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
~ big_g(X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).
cnf(c_0_8,negated_conjecture,
big_f(X1,X1),
inference(sr,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN326+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34 % Computer : n026.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.34 % DateTime : Sat Aug 26 22:07:18 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.57 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
%------------------------------------------------------------------------------