TSTP Solution File: SYN349+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN349+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 : 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:51:19 EDT 2023
% Result : Theorem 0.19s 0.55s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 4 unt; 3 typ; 0 def)
% Number of atoms : 76 ( 0 equ)
% Maximal formula atoms : 36 ( 5 avg)
% Number of connectives : 95 ( 34 ~; 42 |; 9 &)
% ( 8 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 3 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-2 aty)
% Number of variables : 27 ( 0 sgn; 6 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
big_f: ( $i * $i ) > $o ).
tff(decl_23,type,
esk1_1: $i > $i ).
tff(decl_24,type,
esk2_2: ( $i * $i ) > $i ).
fof(church_46_17_5,conjecture,
? [X1] :
! [X2] :
? [X3] :
! [X4] :
( ( big_f(X1,X4)
<=> big_f(X2,X4) )
=> ( ( ( big_f(X1,X4)
<=> big_f(X4,X3) )
<=> big_f(X3,X4) )
<=> big_f(X4,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_17_5) ).
fof(c_0_1,negated_conjecture,
~ ? [X1] :
! [X2] :
? [X3] :
! [X4] :
( ( big_f(X1,X4)
<=> big_f(X2,X4) )
=> ( ( ( big_f(X1,X4)
<=> big_f(X4,X3) )
<=> big_f(X3,X4) )
<=> big_f(X4,X2) ) ),
inference(assume_negation,[status(cth)],[church_46_17_5]) ).
fof(c_0_2,negated_conjecture,
! [X5,X7] :
( ( ~ big_f(X5,esk2_2(X5,X7))
| big_f(esk1_1(X5),esk2_2(X5,X7)) )
& ( ~ big_f(esk1_1(X5),esk2_2(X5,X7))
| big_f(X5,esk2_2(X5,X7)) )
& ( ~ big_f(X5,esk2_2(X5,X7))
| ~ big_f(esk2_2(X5,X7),X7)
| ~ big_f(X7,esk2_2(X5,X7))
| ~ big_f(esk2_2(X5,X7),esk1_1(X5)) )
& ( big_f(X5,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),X7)
| ~ big_f(X7,esk2_2(X5,X7))
| ~ big_f(esk2_2(X5,X7),esk1_1(X5)) )
& ( ~ big_f(X5,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),X7)
| big_f(X7,esk2_2(X5,X7))
| ~ big_f(esk2_2(X5,X7),esk1_1(X5)) )
& ( ~ big_f(esk2_2(X5,X7),X7)
| big_f(X5,esk2_2(X5,X7))
| big_f(X7,esk2_2(X5,X7))
| ~ big_f(esk2_2(X5,X7),esk1_1(X5)) )
& ( ~ big_f(X5,esk2_2(X5,X7))
| ~ big_f(esk2_2(X5,X7),X7)
| big_f(X7,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),esk1_1(X5)) )
& ( big_f(X5,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),X7)
| big_f(X7,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),esk1_1(X5)) )
& ( ~ big_f(X5,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),X7)
| ~ big_f(X7,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),esk1_1(X5)) )
& ( ~ big_f(esk2_2(X5,X7),X7)
| big_f(X5,esk2_2(X5,X7))
| ~ big_f(X7,esk2_2(X5,X7))
| big_f(esk2_2(X5,X7),esk1_1(X5)) ) ),
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(esk2_2(X1,X2),X2)
| big_f(esk2_2(X1,X2),esk1_1(X1))
| ~ big_f(X1,esk2_2(X1,X2))
| ~ big_f(X2,esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( big_f(esk1_1(X1),esk2_2(X1,X2))
| ~ big_f(X1,esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( ~ big_f(X1,esk2_2(X1,X2))
| ~ big_f(esk2_2(X1,X2),X2)
| ~ big_f(X2,esk2_2(X1,X2))
| ~ big_f(esk2_2(X1,X2),esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( big_f(esk2_2(X1,esk1_1(X1)),esk1_1(X1))
| ~ big_f(X1,esk2_2(X1,esk1_1(X1))) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( big_f(X1,esk2_2(X1,X2))
| ~ big_f(esk1_1(X1),esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
( ~ big_f(esk1_1(X1),esk2_2(X1,esk1_1(X1)))
| ~ big_f(esk2_2(X1,esk1_1(X1)),esk1_1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
cnf(c_0_9,negated_conjecture,
~ big_f(esk1_1(X1),esk2_2(X1,esk1_1(X1))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_6]),c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( big_f(X1,esk2_2(X1,X2))
| big_f(esk2_2(X1,X2),X2)
| big_f(X2,esk2_2(X1,X2))
| big_f(esk2_2(X1,X2),esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
~ big_f(X1,esk2_2(X1,esk1_1(X1))),
inference(spm,[status(thm)],[c_0_9,c_0_4]) ).
cnf(c_0_12,negated_conjecture,
( big_f(X1,esk2_2(X1,X2))
| big_f(X2,esk2_2(X1,X2))
| ~ big_f(esk2_2(X1,X2),X2)
| ~ big_f(esk2_2(X1,X2),esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
big_f(esk2_2(X1,esk1_1(X1)),esk1_1(X1)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_10]),c_0_9]),c_0_11]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_13])]),c_0_9]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN349+1 : TPTP v8.1.2. Released v2.0.0.
% 0.06/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.33 % Computer : n017.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sat Aug 26 18:18:11 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.54 start to proof: theBenchmark
% 0.19/0.55 % Version : CSE_E---1.5
% 0.19/0.55 % Problem : theBenchmark.p
% 0.19/0.55 % Proof found
% 0.19/0.55 % SZS status Theorem for theBenchmark.p
% 0.19/0.55 % SZS output start Proof
% See solution above
% 0.19/0.55 % Total time : 0.005000 s
% 0.19/0.55 % SZS output end Proof
% 0.19/0.55 % Total time : 0.008000 s
%------------------------------------------------------------------------------