TSTP Solution File: COL059-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : COL059-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 : n013.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:19 EDT 2023
% Result : Unsatisfiable 0.20s 0.60s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of formulae : 41 ( 35 unt; 6 typ; 0 def)
% Number of atoms : 35 ( 34 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 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 : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 30 ( 11 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
kestrel: $i ).
tff(decl_23,type,
response: ( $i * $i ) > $i ).
tff(decl_24,type,
lark: $i ).
tff(decl_25,type,
x2: $i ).
tff(decl_26,type,
l2: $i ).
tff(decl_27,type,
l3: $i ).
cnf(lark_lemma1,axiom,
response(response(response(lark,lark),X1),X2) = response(response(X1,X1),response(X2,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lark_lemma1) ).
cnf(l2_definition,axiom,
response(lark,lark) = l2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_definition) ).
cnf(lark_exists,axiom,
response(response(lark,X1),X2) = response(X1,response(X2,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lark_exists) ).
cnf(l3_definition,axiom,
response(l2,lark) = l3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l3_definition) ).
cnf(prove_l3_not_egocentric,negated_conjecture,
response(l3,l3) = l3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_l3_not_egocentric) ).
cnf(lark_lemma2,axiom,
response(response(response(response(lark,lark),lark),X1),X2) = response(response(response(X1,X1),response(X1,X1)),response(x2,x2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lark_lemma2) ).
cnf(kestrel_exists,axiom,
response(response(kestrel,X1),X2) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kestrel_exists) ).
cnf(lark_not_egocentric,axiom,
response(l2,l2) != l2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lark_not_egocentric) ).
cnf(c_0_8,axiom,
response(response(response(lark,lark),X1),X2) = response(response(X1,X1),response(X2,X2)),
lark_lemma1 ).
cnf(c_0_9,axiom,
response(lark,lark) = l2,
l2_definition ).
cnf(c_0_10,axiom,
response(response(lark,X1),X2) = response(X1,response(X2,X2)),
lark_exists ).
cnf(c_0_11,plain,
response(response(X1,X1),response(X2,X2)) = response(response(l2,X1),X2),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,axiom,
response(l2,lark) = l3,
l3_definition ).
cnf(c_0_13,plain,
response(lark,response(X1,X1)) = response(l2,X1),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
response(l3,l3) = l3,
prove_l3_not_egocentric ).
cnf(c_0_15,plain,
response(l2,response(X1,X1)) = response(l3,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_9]),c_0_12]) ).
cnf(c_0_16,negated_conjecture,
response(l2,l3) = response(lark,l3),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,axiom,
response(response(response(response(lark,lark),lark),X1),X2) = response(response(response(X1,X1),response(X1,X1)),response(x2,x2)),
lark_lemma2 ).
cnf(c_0_18,negated_conjecture,
response(lark,l3) = l3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_16]),c_0_14]) ).
cnf(c_0_19,plain,
response(response(l3,X1),X2) = response(response(response(l2,X1),X1),response(x2,x2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_9]),c_0_12]),c_0_11]) ).
cnf(c_0_20,negated_conjecture,
response(l3,response(X1,X1)) = response(l3,X1),
inference(spm,[status(thm)],[c_0_10,c_0_18]) ).
cnf(c_0_21,plain,
response(l3,x2) = response(l3,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_19]),c_0_16]),c_0_18]),c_0_14]),c_0_20]),c_0_16]),c_0_18]) ).
cnf(c_0_22,plain,
response(l3,X1) = response(l3,X2),
inference(spm,[status(thm)],[c_0_21,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
response(l3,X1) = l3,
inference(spm,[status(thm)],[c_0_14,c_0_22]) ).
cnf(c_0_24,axiom,
response(response(kestrel,X1),X2) = X1,
kestrel_exists ).
cnf(c_0_25,plain,
response(l2,response(X1,X1)) = l3,
inference(rw,[status(thm)],[c_0_15,c_0_23]) ).
cnf(c_0_26,plain,
response(response(l2,kestrel),X1) = kestrel,
inference(spm,[status(thm)],[c_0_24,c_0_11]) ).
cnf(c_0_27,plain,
response(l3,lark) = response(l2,l2),
inference(spm,[status(thm)],[c_0_15,c_0_9]) ).
cnf(c_0_28,plain,
response(l2,kestrel) = l3,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,axiom,
response(l2,l2) != l2,
lark_not_egocentric ).
cnf(c_0_30,plain,
response(l2,l2) = l3,
inference(rw,[status(thm)],[c_0_27,c_0_23]) ).
cnf(c_0_31,plain,
kestrel = l3,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_28]),c_0_23]) ).
cnf(c_0_32,plain,
l3 != l2,
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
l3 = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_31]),c_0_23]),c_0_23]) ).
cnf(c_0_34,plain,
$false,
inference(sr,[status(thm)],[c_0_32,c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : COL059-1 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun Aug 27 05:15:02 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.59 start to proof: theBenchmark
% 0.20/0.60 % Version : CSE_E---1.5
% 0.20/0.60 % Problem : theBenchmark.p
% 0.20/0.60 % Proof found
% 0.20/0.60 % SZS status Theorem for theBenchmark.p
% 0.20/0.60 % SZS output start Proof
% See solution above
% 0.20/0.60 % Total time : 0.006000 s
% 0.20/0.60 % SZS output end Proof
% 0.20/0.60 % Total time : 0.008000 s
%------------------------------------------------------------------------------