TSTP Solution File: COL026-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : COL026-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 : n024.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:07 EDT 2023
% Result : Unsatisfiable 0.73s 0.78s
% Output : CNFRefutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 21 ( 17 unt; 4 typ; 0 def)
% Number of atoms : 17 ( 16 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
b: $i ).
tff(decl_23,type,
apply: ( $i * $i ) > $i ).
tff(decl_24,type,
w1: $i ).
tff(decl_25,type,
combinator: $i ).
cnf(w1_definition,axiom,
apply(apply(w1,X1),X2) = apply(apply(X2,X1),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',w1_definition) ).
cnf(b_definition,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_definition) ).
cnf(prove_fixed_point,negated_conjecture,
X1 != apply(combinator,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_fixed_point) ).
cnf(c_0_3,axiom,
apply(apply(w1,X1),X2) = apply(apply(X2,X1),X1),
w1_definition ).
cnf(c_0_4,axiom,
apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)),
b_definition ).
cnf(c_0_5,plain,
apply(apply(w1,X1),apply(b,X2)) = apply(X2,apply(X1,X1)),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,negated_conjecture,
X1 != apply(combinator,X1),
prove_fixed_point ).
cnf(c_0_7,plain,
apply(apply(apply(w1,X1),apply(b,apply(b,X2))),X3) = apply(X2,apply(apply(X1,X1),X3)),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_8,plain,
apply(apply(apply(w1,X1),X2),X1) = apply(apply(w1,X1),apply(X2,X1)),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_9,negated_conjecture,
apply(apply(apply(w1,X1),apply(b,apply(b,combinator))),X2) != apply(apply(X1,X1),X2),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
apply(apply(w1,X1),w1) = apply(apply(X1,X1),X1),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_11,plain,
apply(apply(w1,X1),apply(apply(b,apply(b,X2)),X1)) = apply(X2,apply(apply(w1,X1),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_3]),c_0_8]) ).
cnf(c_0_12,plain,
apply(apply(w1,X1),apply(apply(b,X2),X3)) = apply(apply(X2,apply(X3,X1)),X1),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_13,negated_conjecture,
apply(combinator,apply(apply(w1,X1),X1)) != apply(apply(w1,X1),w1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_8]),c_0_11]) ).
cnf(c_0_14,plain,
apply(apply(w1,X1),apply(apply(b,apply(b,X2)),X3)) = apply(X2,apply(apply(X3,X1),X1)),
inference(spm,[status(thm)],[c_0_4,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
apply(apply(w1,X1),apply(apply(b,apply(b,combinator)),w1)) != apply(apply(w1,X1),w1),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_15,c_0_3]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COL026-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n024.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 : Sun Aug 27 05:02:23 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.73/0.78 % Version : CSE_E---1.5
% 0.73/0.78 % Problem : theBenchmark.p
% 0.73/0.78 % Proof found
% 0.73/0.78 % SZS status Theorem for theBenchmark.p
% 0.73/0.78 % SZS output start Proof
% See solution above
% 0.73/0.78 % Total time : 0.194000 s
% 0.73/0.78 % SZS output end Proof
% 0.73/0.78 % Total time : 0.196000 s
%------------------------------------------------------------------------------