TSTP Solution File: SYN354-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN354-1 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n011.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:21 EDT 2023
% Result : Unsatisfiable 0.18s 0.58s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of formulae : 18 ( 5 unt; 5 typ; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 35 ( 17 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 14 ( 4 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
a: $i ).
tff(decl_23,type,
b: $i ).
tff(decl_24,type,
f: ( $i * $i ) > $o ).
tff(decl_25,type,
g: ( $i * $i ) > $o ).
tff(decl_26,type,
z: ( $i * $i ) > $i ).
cnf(clause3,negated_conjecture,
( g(b,z(X1,X2))
| g(X2,z(X1,X2))
| f(b,X2)
| ~ f(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause3) ).
cnf(clause1,negated_conjecture,
f(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).
cnf(clause7,negated_conjecture,
( ~ f(a,X1)
| ~ f(b,X1)
| ~ f(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause7) ).
cnf(clause4,negated_conjecture,
( f(b,X2)
| ~ g(b,z(X1,X2))
| ~ g(X2,z(X1,X2))
| ~ f(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause4) ).
cnf(c_0_4,negated_conjecture,
( g(b,z(X1,X2))
| g(X2,z(X1,X2))
| f(b,X2)
| ~ f(X1,X2) ),
clause3 ).
cnf(c_0_5,negated_conjecture,
f(a,b),
clause1 ).
cnf(c_0_6,negated_conjecture,
( ~ f(a,X1)
| ~ f(b,X1)
| ~ f(X1,X2) ),
clause7 ).
cnf(c_0_7,negated_conjecture,
( f(b,X2)
| ~ g(b,z(X1,X2))
| ~ g(X2,z(X1,X2))
| ~ f(X1,X2) ),
clause4 ).
cnf(c_0_8,negated_conjecture,
( g(b,z(a,b))
| f(b,b) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_9,negated_conjecture,
( ~ f(b,b)
| ~ f(b,X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_10,negated_conjecture,
f(b,b),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_5])]),c_0_8]) ).
cnf(c_0_11,negated_conjecture,
~ f(b,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_10,c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN354-1 : TPTP v8.1.2. Released v1.2.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sat Aug 26 17:10:54 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.57 start to proof: theBenchmark
% 0.18/0.58 % Version : CSE_E---1.5
% 0.18/0.58 % Problem : theBenchmark.p
% 0.18/0.58 % Proof found
% 0.18/0.58 % SZS status Theorem for theBenchmark.p
% 0.18/0.58 % SZS output start Proof
% See solution above
% 0.18/0.58 % Total time : 0.004000 s
% 0.18/0.58 % SZS output end Proof
% 0.18/0.58 % Total time : 0.005000 s
%------------------------------------------------------------------------------