TSTP Solution File: SYN066-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN066-1 : TPTP v8.1.2. Released v1.0.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 01:49:27 EDT 2023
% Result : Unsatisfiable 0.22s 0.60s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of formulae : 21 ( 6 unt; 8 typ; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 13 ( 6 ~; 7 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 7 >; 6 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 24 ( 11 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
big_p: ( $i * $i ) > $o ).
tff(decl_23,type,
f: ( $i * $i ) > $i ).
tff(decl_24,type,
g: $i > $i ).
tff(decl_25,type,
h: ( $i * $i ) > $i ).
tff(decl_26,type,
big_q: ( $i * $i ) > $o ).
tff(decl_27,type,
i: ( $i * $i ) > $i ).
tff(decl_28,type,
big_r: ( $i * $i ) > $o ).
tff(decl_29,type,
a: $i ).
cnf(clause_5,axiom,
( big_r(X3,X3)
| ~ big_q(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_4,axiom,
( big_p(X1,X2)
| big_q(i(X1,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_6,negated_conjecture,
~ big_r(a,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_3,axiom,
( big_q(h(X1,X2),g(X1))
| ~ big_p(f(X1,X2),g(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(c_0_4,axiom,
( big_r(X3,X3)
| ~ big_q(X1,X2) ),
clause_5 ).
cnf(c_0_5,axiom,
( big_p(X1,X2)
| big_q(i(X1,X2),X1) ),
clause_4 ).
cnf(c_0_6,negated_conjecture,
~ big_r(a,X1),
clause_6 ).
cnf(c_0_7,plain,
( big_r(X1,X1)
| big_p(X2,X3) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,axiom,
( big_q(h(X1,X2),g(X1))
| ~ big_p(f(X1,X2),g(X1)) ),
clause_3 ).
cnf(c_0_9,negated_conjecture,
big_p(X1,X2),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
big_q(h(X1,X2),g(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]) ).
cnf(c_0_11,plain,
big_r(X1,X1),
inference(spm,[status(thm)],[c_0_4,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_6,c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN066-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 19:47:27 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.22/0.59 start to proof: theBenchmark
% 0.22/0.60 % Version : CSE_E---1.5
% 0.22/0.60 % Problem : theBenchmark.p
% 0.22/0.60 % Proof found
% 0.22/0.60 % SZS status Theorem for theBenchmark.p
% 0.22/0.60 % SZS output start Proof
% See solution above
% 0.22/0.60 % Total time : 0.003000 s
% 0.22/0.60 % SZS output end Proof
% 0.22/0.60 % Total time : 0.006000 s
%------------------------------------------------------------------------------