TSTP Solution File: SYO629-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYO629-1 : TPTP v8.1.2. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n021.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:07 EDT 2023
% Result : Unsatisfiable 0.21s 0.61s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of formulae : 32 ( 11 unt; 7 typ; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 48 ( 24 ~; 24 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 6 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 28 ( 4 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
f: $i > $i ).
tff(decl_23,type,
g: $i > $i ).
tff(decl_24,type,
'E': ( $i * $i ) > $o ).
tff(decl_25,type,
iLEQ: ( $i * $i ) > $o ).
tff(decl_26,type,
'0': $i ).
tff(decl_27,type,
s: $i > $i ).
tff(decl_28,type,
'LE': ( $i * $i ) > $o ).
cnf(clause_10_06,axiom,
( 'E'('0',f(X2))
| 'LE'(f(X2),'0')
| ~ 'LE'(f(X1),s('0'))
| ~ iLEQ(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10_06) ).
cnf(clause_7_05,axiom,
~ 'LE'(f(X1),'0'),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7_05) ).
cnf(clause_6_04,axiom,
( 'E'(s('0'),f(X1))
| 'LE'(f(X1),s('0')) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6_04) ).
cnf(clause_1_07,axiom,
( 'E'(f(X1),f(g(X1)))
| ~ 'E'(s('0'),f(X1))
| ~ 'E'(s('0'),f(g(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1_07) ).
cnf(clause_8_01,axiom,
~ 'E'(f(X1),f(g(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8_01) ).
cnf(clause_0_02,axiom,
iLEQ(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_0_02) ).
cnf(clause_3_09,axiom,
iLEQ(X1,g(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3_09) ).
cnf(clause_11_03,axiom,
( 'E'(f(X1),f(g(X1)))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(g(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11_03) ).
cnf(c_0_8,axiom,
( 'E'('0',f(X2))
| 'LE'(f(X2),'0')
| ~ 'LE'(f(X1),s('0'))
| ~ iLEQ(X1,X2) ),
clause_10_06 ).
cnf(c_0_9,axiom,
~ 'LE'(f(X1),'0'),
clause_7_05 ).
cnf(c_0_10,plain,
( 'E'('0',f(X1))
| ~ 'LE'(f(X2),s('0'))
| ~ iLEQ(X2,X1) ),
inference(sr,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
( 'E'(s('0'),f(X1))
| 'LE'(f(X1),s('0')) ),
clause_6_04 ).
cnf(c_0_12,axiom,
( 'E'(f(X1),f(g(X1)))
| ~ 'E'(s('0'),f(X1))
| ~ 'E'(s('0'),f(g(X1))) ),
clause_1_07 ).
cnf(c_0_13,axiom,
~ 'E'(f(X1),f(g(X1))),
clause_8_01 ).
cnf(c_0_14,plain,
( 'E'(s('0'),f(X1))
| 'E'('0',f(X2))
| ~ iLEQ(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,axiom,
iLEQ(X1,X1),
clause_0_02 ).
cnf(c_0_16,axiom,
iLEQ(X1,g(X1)),
clause_3_09 ).
cnf(c_0_17,axiom,
( 'E'(f(X1),f(g(X1)))
| ~ 'E'('0',f(X1))
| ~ 'E'('0',f(g(X1))) ),
clause_11_03 ).
cnf(c_0_18,plain,
( ~ 'E'(s('0'),f(g(X1)))
| ~ 'E'(s('0'),f(X1)) ),
inference(sr,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( 'E'(s('0'),f(X1))
| 'E'('0',f(X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( 'E'('0',f(g(X1)))
| 'E'(s('0'),f(X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_21,plain,
( ~ 'E'('0',f(g(X1)))
| ~ 'E'('0',f(X1)) ),
inference(sr,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_22,plain,
'E'('0',f(g(X1))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_23,plain,
~ 'E'('0',f(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_24,plain,
$false,
inference(sr,[status(thm)],[c_0_22,c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SYO629-1 : TPTP v8.1.2. Released v7.1.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.36 % Computer : n021.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sat Aug 26 06:16:11 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.60 start to proof: theBenchmark
% 0.21/0.61 % Version : CSE_E---1.5
% 0.21/0.61 % Problem : theBenchmark.p
% 0.21/0.61 % Proof found
% 0.21/0.61 % SZS status Theorem for theBenchmark.p
% 0.21/0.61 % SZS output start Proof
% See solution above
% 0.21/0.61 % Total time : 0.003000 s
% 0.21/0.61 % SZS output end Proof
% 0.21/0.61 % Total time : 0.006000 s
%------------------------------------------------------------------------------