TSTP Solution File: COL091-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : COL091-1 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n016.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:34 EDT 2023
% Result : Unsatisfiable 0.21s 0.60s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 28
% Syntax : Number of formulae : 44 ( 11 unt; 18 typ; 0 def)
% Number of atoms : 47 ( 11 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 46 ( 25 ~; 21 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 31 ( 12 >; 19 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 50 ( 12 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
combK: $i ).
tff(decl_23,type,
combS: $i ).
tff(decl_24,type,
comb_app: ( $i * $i ) > $i ).
tff(decl_25,type,
comb: $i ).
tff(decl_26,type,
member: ( $i * $i ) > $o ).
tff(decl_27,type,
pair: ( $i * $i ) > $i ).
tff(decl_28,type,
contract: $i ).
tff(decl_29,type,
rtrancl: $i > $i ).
tff(decl_30,type,
ap_contractE_c1: ( $i * $i * $i ) > $o ).
tff(decl_31,type,
ap_contractE_c2: ( $i * $i * $i ) > $o ).
tff(decl_32,type,
ap_contractE_c3: ( $i * $i * $i ) > $o ).
tff(decl_33,type,
ap_contractE_c4: ( $i * $i * $i ) > $o ).
tff(decl_34,type,
ap_contractE_sk1p: ( $i * $i * $i ) > $i ).
tff(decl_35,type,
ap_contractE_sk1q: ( $i * $i * $i ) > $i ).
tff(decl_36,type,
ap_contractE_sk2q: ( $i * $i * $i ) > $i ).
tff(decl_37,type,
ap_contractE_sk3q: ( $i * $i * $i ) > $i ).
tff(decl_38,type,
p: $i ).
tff(decl_39,type,
r: $i ).
cnf(k1_contractD_c1,negated_conjecture,
( r != comb_app(combK,X1)
| ~ member(pair(p,X1),contract) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k1_contractD_c1) ).
cnf(ap_contractE13,axiom,
( member(pair(X2,ap_contractE_sk3q(X1,X2,X3)),contract)
| ~ ap_contractE_c4(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_contractE13) ).
cnf(ap_contractE15,axiom,
( X3 = comb_app(X1,ap_contractE_sk3q(X1,X2,X3))
| ~ ap_contractE_c4(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_contractE15) ).
cnf(k_contractE,axiom,
~ member(pair(combK,X1),contract),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k_contractE) ).
cnf(ap_contractE10,axiom,
( member(pair(X1,ap_contractE_sk2q(X1,X2,X3)),contract)
| ~ ap_contractE_c3(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_contractE10) ).
cnf(k_app,axiom,
combK != comb_app(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k_app) ).
cnf(ap_contractE9,axiom,
( X1 = comb_app(comb_app(combS,ap_contractE_sk1p(X1,X2,X3)),ap_contractE_sk1q(X1,X2,X3))
| ~ ap_contractE_c2(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_contractE9) ).
cnf(ap_contractE1,axiom,
( ap_contractE_c1(X1,X2,X3)
| ap_contractE_c2(X1,X2,X3)
| ap_contractE_c3(X1,X2,X3)
| ap_contractE_c4(X1,X2,X3)
| ~ member(pair(comb_app(X1,X2),X3),contract) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_contractE1) ).
cnf(k1_contractD_h1,hypothesis,
member(pair(comb_app(combK,p),r),contract),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k1_contractD_h1) ).
cnf(ap_contractE4,axiom,
( X1 = comb_app(combK,X3)
| ~ ap_contractE_c1(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap_contractE4) ).
cnf(c_0_10,negated_conjecture,
( r != comb_app(combK,X1)
| ~ member(pair(p,X1),contract) ),
k1_contractD_c1 ).
cnf(c_0_11,axiom,
( member(pair(X2,ap_contractE_sk3q(X1,X2,X3)),contract)
| ~ ap_contractE_c4(X1,X2,X3) ),
ap_contractE13 ).
cnf(c_0_12,negated_conjecture,
( comb_app(combK,ap_contractE_sk3q(X1,p,X2)) != r
| ~ ap_contractE_c4(X1,p,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
( X3 = comb_app(X1,ap_contractE_sk3q(X1,X2,X3))
| ~ ap_contractE_c4(X1,X2,X3) ),
ap_contractE15 ).
cnf(c_0_14,axiom,
~ member(pair(combK,X1),contract),
k_contractE ).
cnf(c_0_15,axiom,
( member(pair(X1,ap_contractE_sk2q(X1,X2,X3)),contract)
| ~ ap_contractE_c3(X1,X2,X3) ),
ap_contractE10 ).
cnf(c_0_16,axiom,
combK != comb_app(X1,X2),
k_app ).
cnf(c_0_17,axiom,
( X1 = comb_app(comb_app(combS,ap_contractE_sk1p(X1,X2,X3)),ap_contractE_sk1q(X1,X2,X3))
| ~ ap_contractE_c2(X1,X2,X3) ),
ap_contractE9 ).
cnf(c_0_18,axiom,
( ap_contractE_c1(X1,X2,X3)
| ap_contractE_c2(X1,X2,X3)
| ap_contractE_c3(X1,X2,X3)
| ap_contractE_c4(X1,X2,X3)
| ~ member(pair(comb_app(X1,X2),X3),contract) ),
ap_contractE1 ).
cnf(c_0_19,hypothesis,
member(pair(comb_app(combK,p),r),contract),
k1_contractD_h1 ).
cnf(c_0_20,negated_conjecture,
~ ap_contractE_c4(combK,p,r),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_21,plain,
~ ap_contractE_c3(combK,X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,plain,
~ ap_contractE_c2(combK,X1,X2),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_23,axiom,
( X1 = comb_app(combK,X3)
| ~ ap_contractE_c1(X1,X2,X3) ),
ap_contractE4 ).
cnf(c_0_24,hypothesis,
ap_contractE_c1(combK,p,r),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21]),c_0_22]) ).
cnf(c_0_25,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : COL091-1 : TPTP v8.1.2. Released v2.7.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n016.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 : Sun Aug 27 04:43:58 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.58 start to proof: theBenchmark
% 0.21/0.60 % Version : CSE_E---1.5
% 0.21/0.60 % Problem : theBenchmark.p
% 0.21/0.60 % Proof found
% 0.21/0.60 % SZS status Theorem for theBenchmark.p
% 0.21/0.60 % SZS output start Proof
% See solution above
% 0.21/0.60 % Total time : 0.008000 s
% 0.21/0.60 % SZS output end Proof
% 0.21/0.60 % Total time : 0.010000 s
%------------------------------------------------------------------------------