TSTP Solution File: COL060-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : COL060-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n012.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 : Wed Aug 30 18:22:20 EDT 2023
% Result : Unsatisfiable 0.19s 0.60s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 18 ( 12 unt; 6 typ; 0 def)
% Number of atoms : 12 ( 11 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 5 ( 4 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
b: $i ).
tff(decl_23,type,
apply: ( $i * $i ) > $i ).
tff(decl_24,type,
t: $i ).
tff(decl_25,type,
f: $i > $i ).
tff(decl_26,type,
g: $i > $i ).
tff(decl_27,type,
h: $i > $i ).
cnf(prove_q_combinator,negated_conjecture,
apply(apply(apply(X1,f(X1)),g(X1)),h(X1)) != apply(g(X1),apply(f(X1),h(X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_q_combinator) ).
cnf(b_definition,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_definition) ).
cnf(t_definition,axiom,
apply(apply(t,X1),X2) = apply(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t_definition) ).
cnf(c_0_3,negated_conjecture,
apply(apply(apply(X1,f(X1)),g(X1)),h(X1)) != apply(g(X1),apply(f(X1),h(X1))),
prove_q_combinator ).
cnf(c_0_4,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
b_definition ).
cnf(c_0_5,negated_conjecture,
apply(apply(apply(X1,apply(X2,f(apply(apply(b,X1),X2)))),g(apply(apply(b,X1),X2))),h(apply(apply(b,X1),X2))) != apply(g(apply(apply(b,X1),X2)),apply(f(apply(apply(b,X1),X2)),h(apply(apply(b,X1),X2)))),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,axiom,
apply(apply(t,X1),X2) = apply(X2,X1),
t_definition ).
cnf(c_0_7,negated_conjecture,
apply(apply(apply(apply(X1,f(apply(apply(b,apply(t,X2)),X1))),X2),g(apply(apply(b,apply(t,X2)),X1))),h(apply(apply(b,apply(t,X2)),X1))) != apply(g(apply(apply(b,apply(t,X2)),X1)),apply(f(apply(apply(b,apply(t,X2)),X1)),h(apply(apply(b,apply(t,X2)),X1)))),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,negated_conjecture,
apply(apply(apply(apply(X1,apply(X2,f(apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2))))),X3),g(apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2)))),h(apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2)))) != apply(g(apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2))),apply(f(apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2))),h(apply(apply(b,apply(t,X3)),apply(apply(b,X1),X2))))),
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
cnf(c_0_9,negated_conjecture,
apply(apply(apply(X1,f(apply(apply(b,apply(t,X2)),apply(apply(b,b),X1)))),apply(X2,g(apply(apply(b,apply(t,X2)),apply(apply(b,b),X1))))),h(apply(apply(b,apply(t,X2)),apply(apply(b,b),X1)))) != apply(g(apply(apply(b,apply(t,X2)),apply(apply(b,b),X1))),apply(f(apply(apply(b,apply(t,X2)),apply(apply(b,b),X1))),h(apply(apply(b,apply(t,X2)),apply(apply(b,b),X1))))),
inference(spm,[status(thm)],[c_0_8,c_0_4]) ).
cnf(c_0_10,negated_conjecture,
apply(apply(apply(X1,g(apply(apply(b,apply(t,X1)),apply(apply(b,b),t)))),f(apply(apply(b,apply(t,X1)),apply(apply(b,b),t)))),h(apply(apply(b,apply(t,X1)),apply(apply(b,b),t)))) != apply(g(apply(apply(b,apply(t,X1)),apply(apply(b,b),t))),apply(f(apply(apply(b,apply(t,X1)),apply(apply(b,b),t))),h(apply(apply(b,apply(t,X1)),apply(apply(b,b),t))))),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_10,c_0_4]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL060-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n012.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 : Sun Aug 27 04:27:10 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 0.19/0.60 % Version : CSE_E---1.5
% 0.19/0.60 % Problem : theBenchmark.p
% 0.19/0.60 % Proof found
% 0.19/0.60 % SZS status Theorem for theBenchmark.p
% 0.19/0.60 % SZS output start Proof
% See solution above
% 0.19/0.60 % Total time : 0.029000 s
% 0.19/0.60 % SZS output end Proof
% 0.19/0.60 % Total time : 0.031000 s
%------------------------------------------------------------------------------