TSTP Solution File: COL031-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : COL031-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 : n005.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:08 EDT 2023
% Result : Unsatisfiable 0.19s 0.56s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of formulae : 13 ( 9 unt; 4 typ; 0 def)
% Number of atoms : 9 ( 8 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
l: $i ).
tff(decl_23,type,
apply: ( $i * $i ) > $i ).
tff(decl_24,type,
o: $i ).
tff(decl_25,type,
f: $i > $i ).
cnf(prove_fixed_point,negated_conjecture,
apply(X1,f(X1)) != apply(f(X1),apply(X1,f(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_fixed_point) ).
cnf(o_definition,axiom,
apply(apply(o,X1),X2) = apply(X2,apply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',o_definition) ).
cnf(l_definition,axiom,
apply(apply(l,X1),X2) = apply(X1,apply(X2,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l_definition) ).
cnf(c_0_3,negated_conjecture,
apply(X1,f(X1)) != apply(f(X1),apply(X1,f(X1))),
prove_fixed_point ).
cnf(c_0_4,axiom,
apply(apply(o,X1),X2) = apply(X2,apply(X1,X2)),
o_definition ).
cnf(c_0_5,negated_conjecture,
apply(apply(o,X1),f(X1)) != apply(X1,f(X1)),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,axiom,
apply(apply(l,X1),X2) = apply(X1,apply(X2,X2)),
l_definition ).
cnf(c_0_7,negated_conjecture,
apply(apply(apply(l,o),X1),f(apply(X1,X1))) != apply(apply(X1,X1),f(apply(X1,X1))),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,negated_conjecture,
$false,
inference(er,[status(thm)],[c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : COL031-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n005.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 04:44:23 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.55 start to proof: theBenchmark
% 0.19/0.56 % Version : CSE_E---1.5
% 0.19/0.56 % Problem : theBenchmark.p
% 0.19/0.56 % Proof found
% 0.19/0.56 % SZS status Theorem for theBenchmark.p
% 0.19/0.56 % SZS output start Proof
% See solution above
% 0.19/0.56 % Total time : 0.003000 s
% 0.19/0.56 % SZS output end Proof
% 0.19/0.56 % Total time : 0.005000 s
%------------------------------------------------------------------------------