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