TSTP Solution File: SYN948+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN948+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n015.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 02:00:18 EDT 2023
% Result : Theorem 0.22s 0.57s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 3 unt; 2 typ; 0 def)
% Number of atoms : 12 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 9 ( 3 ~; 0 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 10 ( 0 sgn; 4 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
a: ( $i * $i ) > $o ).
tff(decl_23,type,
esk1_1: $i > $i ).
fof(prove_this,conjecture,
( ! [X1] :
? [X2] :
( a(X1,X2)
& a(X2,X2) )
=> ? [X3] : a(X3,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(c_0_1,negated_conjecture,
~ ( ! [X1] :
? [X2] :
( a(X1,X2)
& a(X2,X2) )
=> ? [X3] : a(X3,X3) ),
inference(assume_negation,[status(cth)],[prove_this]) ).
fof(c_0_2,negated_conjecture,
! [X4,X6] :
( a(X4,esk1_1(X4))
& a(esk1_1(X4),esk1_1(X4))
& ~ a(X6,X6) ),
inference(shift_quantors,[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,
a(esk1_1(X1),esk1_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
~ a(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_3,c_0_4]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN948+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.15/0.36 % Computer : n015.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sat Aug 26 17:38:53 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.56 start to proof: theBenchmark
% 0.22/0.57 % Version : CSE_E---1.5
% 0.22/0.57 % Problem : theBenchmark.p
% 0.22/0.57 % Proof found
% 0.22/0.57 % SZS status Theorem for theBenchmark.p
% 0.22/0.57 % SZS output start Proof
% See solution above
% 0.22/0.57 % Total time : 0.003000 s
% 0.22/0.57 % SZS output end Proof
% 0.22/0.57 % Total time : 0.005000 s
%------------------------------------------------------------------------------