TSTP Solution File: SYO632-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYO632-1 : TPTP v8.1.2. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n029.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 04:12:20 EDT 2023
% Result : Unsatisfiable 0.19s 0.59s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 13
% Syntax : Number of formulae : 21 ( 7 unt; 8 typ; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 18 ( 12 ~; 4 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 11 ( 9 sgn; 2 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
'0': $i ).
tff(decl_23,type,
'AP': ( $i * $i ) > $i ).
tff(decl_24,type,
s: $i > $i ).
tff(decl_25,type,
'LEQ': ( $i * $i ) > $o ).
tff(decl_26,type,
f: $i > $i ).
tff(decl_27,type,
'E': ( $i * $i ) > $o ).
tff(decl_28,type,
epred1_0: $o ).
tff(decl_29,type,
epred2_0: $o ).
cnf(clause_1_04,axiom,
( ~ 'E'(f(X1),'0')
| ~ 'E'(f(X2),s('0')) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1_04) ).
cnf(clause_2_02,axiom,
'E'(f('AP'(s(s('0')),X1)),'0'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2_02) ).
cnf(clause_0_03,axiom,
'E'(f(X1),s('0')),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_0_03) ).
fof(c_0_3,plain,
( ~ epred2_0
<=> ! [X1] : ~ 'E'(f(X1),'0') ),
introduced(definition) ).
fof(c_0_4,plain,
( ~ epred1_0
<=> ! [X2] : ~ 'E'(f(X2),s('0')) ),
introduced(definition) ).
cnf(c_0_5,axiom,
( ~ 'E'(f(X1),'0')
| ~ 'E'(f(X2),s('0')) ),
clause_1_04 ).
cnf(c_0_6,plain,
( epred2_0
| ~ 'E'(f(X1),'0') ),
inference(split_equiv,[status(thm)],[c_0_3]) ).
cnf(c_0_7,axiom,
'E'(f('AP'(s(s('0')),X1)),'0'),
clause_2_02 ).
cnf(c_0_8,plain,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_5,c_0_4]),c_0_3]) ).
cnf(c_0_9,plain,
epred2_0,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,axiom,
'E'(f(X1),s('0')),
clause_0_03 ).
cnf(c_0_11,plain,
~ epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).
cnf(c_0_12,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(split_equiv,[status(thm)],[c_0_4]),c_0_10])]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO632-1 : TPTP v8.1.2. Released v7.1.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n029.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 06:40:24 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.57 start to proof: theBenchmark
% 0.19/0.59 % Version : CSE_E---1.5
% 0.19/0.59 % Problem : theBenchmark.p
% 0.19/0.59 % Proof found
% 0.19/0.59 % SZS status Theorem for theBenchmark.p
% 0.19/0.59 % SZS output start Proof
% See solution above
% 0.19/0.59 % Total time : 0.003000 s
% 0.19/0.59 % SZS output end Proof
% 0.19/0.59 % Total time : 0.006000 s
%------------------------------------------------------------------------------