TSTP Solution File: SYN332+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN332+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 : n027.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:10 EDT 2023
% Result : Theorem 0.20s 0.59s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 3 unt; 2 typ; 0 def)
% Number of atoms : 86 ( 0 equ)
% Maximal formula atoms : 34 ( 5 avg)
% Number of connectives : 97 ( 27 ~; 33 |; 15 &)
% ( 11 <=>; 10 =>; 0 <=; 1 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 31 ( 2 sgn; 4 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
big_f: ( $i * $i ) > $o ).
tff(decl_23,type,
esk1_2: ( $i * $i ) > $i ).
fof(church_46_14_4,conjecture,
? [X1,X2] :
! [X3] :
( ( ( big_f(X1,X2)
& big_f(X2,X1) )
<~> big_f(X1,X3) )
=> ( ( big_f(X1,X3)
<=> big_f(X3,X1) )
=> ( ( big_f(X1,X3)
<=> big_f(X2,X3) )
=> ( ( ( big_f(X2,X1)
=> big_f(X1,X2) )
<=> big_f(X3,X3) )
=> ( ( big_f(X1,X2)
<=> big_f(X2,X1) )
<=> big_f(X3,X2) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_14_4) ).
fof(c_0_1,negated_conjecture,
~ ? [X1,X2] :
! [X3] :
( ~ ( ( big_f(X1,X2)
& big_f(X2,X1) )
<=> big_f(X1,X3) )
=> ( ( big_f(X1,X3)
<=> big_f(X3,X1) )
=> ( ( big_f(X1,X3)
<=> big_f(X2,X3) )
=> ( ( ( big_f(X2,X1)
=> big_f(X1,X2) )
<=> big_f(X3,X3) )
=> ( ( big_f(X1,X2)
<=> big_f(X2,X1) )
<=> big_f(X3,X2) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[church_46_14_4])]) ).
fof(c_0_2,negated_conjecture,
! [X4,X5] :
( ( ~ big_f(X4,X5)
| ~ big_f(X5,X4)
| ~ big_f(X4,esk1_2(X4,X5)) )
& ( big_f(X4,X5)
| big_f(X4,esk1_2(X4,X5)) )
& ( big_f(X5,X4)
| big_f(X4,esk1_2(X4,X5)) )
& ( ~ big_f(X4,esk1_2(X4,X5))
| big_f(esk1_2(X4,X5),X4) )
& ( ~ big_f(esk1_2(X4,X5),X4)
| big_f(X4,esk1_2(X4,X5)) )
& ( ~ big_f(X4,esk1_2(X4,X5))
| big_f(X5,esk1_2(X4,X5)) )
& ( ~ big_f(X5,esk1_2(X4,X5))
| big_f(X4,esk1_2(X4,X5)) )
& ( big_f(X5,X4)
| big_f(esk1_2(X4,X5),esk1_2(X4,X5)) )
& ( ~ big_f(X4,X5)
| big_f(esk1_2(X4,X5),esk1_2(X4,X5)) )
& ( ~ big_f(esk1_2(X4,X5),esk1_2(X4,X5))
| ~ big_f(X5,X4)
| big_f(X4,X5) )
& ( ~ big_f(X4,X5)
| ~ big_f(X5,X4)
| ~ big_f(esk1_2(X4,X5),X5) )
& ( big_f(X4,X5)
| big_f(X5,X4)
| ~ big_f(esk1_2(X4,X5),X5) )
& ( ~ big_f(X4,X5)
| big_f(X5,X4)
| big_f(esk1_2(X4,X5),X5) )
& ( ~ big_f(X5,X4)
| big_f(X4,X5)
| big_f(esk1_2(X4,X5),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(X1,X2)
| big_f(X2,X1)
| ~ big_f(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( big_f(esk1_2(X1,X2),X1)
| ~ big_f(X1,esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( big_f(X1,X2)
| big_f(X1,esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
( big_f(X1,X2)
| ~ big_f(esk1_2(X1,X2),esk1_2(X1,X2))
| ~ big_f(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_7,negated_conjecture,
big_f(X1,X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( big_f(X2,esk1_2(X1,X2))
| ~ big_f(X1,esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
( big_f(X1,X2)
| big_f(X2,esk1_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( big_f(X1,X2)
| ~ big_f(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).
cnf(c_0_11,negated_conjecture,
( big_f(X1,esk1_2(X2,X1))
| big_f(X1,X2) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( big_f(esk1_2(X1,X2),X2)
| big_f(X2,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,negated_conjecture,
( ~ big_f(X1,X2)
| ~ big_f(X2,X1)
| ~ big_f(X1,esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
big_f(X1,X2),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_12]),c_0_10]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_14]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN332+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35 % Computer : n027.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat Aug 26 21:13:50 EDT 2023
% 0.13/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.006000 s
% 0.20/0.59 % SZS output end Proof
% 0.20/0.59 % Total time : 0.009000 s
%------------------------------------------------------------------------------