TSTP Solution File: SYN398+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN398+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 : n005.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:36 EDT 2023
% Result : Theorem 0.20s 0.58s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 3 unt; 4 typ; 0 def)
% Number of atoms : 36 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 39 ( 14 ~; 15 |; 8 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 9 ( 3 sgn; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
p: $o ).
tff(decl_23,type,
f: $i > $o ).
tff(decl_24,type,
esk1_0: $i ).
tff(decl_25,type,
esk2_0: $i ).
fof(kalish215,conjecture,
( ! [X1] :
( p
& f(X1) )
<=> ( p
& ! [X2] : f(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish215) ).
fof(c_0_1,negated_conjecture,
~ ( ! [X1] :
( p
& f(X1) )
<=> ( p
& ! [X2] : f(X2) ) ),
inference(assume_negation,[status(cth)],[kalish215]) ).
fof(c_0_2,negated_conjecture,
! [X5,X6] :
( ( ~ p
| ~ f(esk1_0)
| ~ p
| ~ f(esk2_0) )
& ( p
| p )
& ( f(X6)
| p )
& ( p
| f(X5) )
& ( f(X6)
| f(X5) ) ),
inference(distribute,[status(thm)],[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
| ~ f(esk1_0)
| ~ p
| ~ f(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( p
| p ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
( ~ p
| ~ f(esk1_0)
| ~ f(esk2_0) ),
inference(cn,[status(thm)],[c_0_3]) ).
cnf(c_0_6,negated_conjecture,
p,
inference(cn,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( ~ f(esk1_0)
| ~ f(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]) ).
cnf(c_0_8,negated_conjecture,
( f(X1)
| f(X2) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
f(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_8]) ).
cnf(c_0_10,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_9]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN398+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat Aug 26 18:50:08 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.20/0.58 % Version : CSE_E---1.5
% 0.20/0.58 % Problem : theBenchmark.p
% 0.20/0.58 % Proof found
% 0.20/0.58 % SZS status Theorem for theBenchmark.p
% 0.20/0.58 % SZS output start Proof
% See solution above
% 0.20/0.58 % Total time : 0.004000 s
% 0.20/0.58 % SZS output end Proof
% 0.20/0.58 % Total time : 0.006000 s
%------------------------------------------------------------------------------