TSTP Solution File: COM002-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : COM002-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 : 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:35:41 EDT 2023
% Result : Unsatisfiable 0.18s 0.60s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 35
% Syntax : Number of formulae : 53 ( 16 unt; 26 typ; 0 def)
% Number of atoms : 43 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 18 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 19 ( 10 >; 9 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 16 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
succeeds: ( $i * $i ) > $o ).
tff(decl_23,type,
follows: ( $i * $i ) > $o ).
tff(decl_24,type,
goto: $i > $i ).
tff(decl_25,type,
has: ( $i * $i ) > $o ).
tff(decl_26,type,
labels: ( $i * $i ) > $o ).
tff(decl_27,type,
ifthen: ( $i * $i ) > $i ).
tff(decl_28,type,
p1: $i ).
tff(decl_29,type,
register_j: $i ).
tff(decl_30,type,
n0: $i ).
tff(decl_31,type,
assign: ( $i * $i ) > $i ).
tff(decl_32,type,
p2: $i ).
tff(decl_33,type,
register_k: $i ).
tff(decl_34,type,
n1: $i ).
tff(decl_35,type,
loop: $i ).
tff(decl_36,type,
p3: $i ).
tff(decl_37,type,
n: $i ).
tff(decl_38,type,
equal_function: ( $i * $i ) > $i ).
tff(decl_39,type,
p4: $i ).
tff(decl_40,type,
out: $i ).
tff(decl_41,type,
p5: $i ).
tff(decl_42,type,
p6: $i ).
tff(decl_43,type,
n2: $i ).
tff(decl_44,type,
times: ( $i * $i ) > $i ).
tff(decl_45,type,
p7: $i ).
tff(decl_46,type,
plus: ( $i * $i ) > $i ).
tff(decl_47,type,
p8: $i ).
cnf(transitivity_of_success,axiom,
( succeeds(X1,X2)
| ~ succeeds(X1,X3)
| ~ succeeds(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_success) ).
cnf(direct_success,axiom,
( succeeds(X1,X2)
| ~ follows(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',direct_success) ).
cnf(goto_success,axiom,
( succeeds(X1,X2)
| ~ has(X2,goto(X3))
| ~ labels(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goto_success) ).
cnf(state_8,hypothesis,
has(p8,goto(loop)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_8) ).
cnf(transition_7_to_8,hypothesis,
follows(p8,p7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_7_to_8) ).
cnf(label_state_3,hypothesis,
labels(loop,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',label_state_3) ).
cnf(transition_6_to_7,hypothesis,
follows(p7,p6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_6_to_7) ).
cnf(transition_3_to_6,hypothesis,
follows(p6,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_3_to_6) ).
cnf(prove_there_is_a_loop_through_p3,negated_conjecture,
~ succeeds(p3,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).
cnf(c_0_9,axiom,
( succeeds(X1,X2)
| ~ succeeds(X1,X3)
| ~ succeeds(X3,X2) ),
transitivity_of_success ).
cnf(c_0_10,axiom,
( succeeds(X1,X2)
| ~ follows(X1,X2) ),
direct_success ).
cnf(c_0_11,axiom,
( succeeds(X1,X2)
| ~ has(X2,goto(X3))
| ~ labels(X3,X1) ),
goto_success ).
cnf(c_0_12,hypothesis,
has(p8,goto(loop)),
state_8 ).
cnf(c_0_13,plain,
( succeeds(X1,X2)
| ~ follows(X3,X2)
| ~ succeeds(X1,X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,hypothesis,
follows(p8,p7),
transition_7_to_8 ).
cnf(c_0_15,hypothesis,
( succeeds(X1,p8)
| ~ labels(loop,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,hypothesis,
labels(loop,p3),
label_state_3 ).
cnf(c_0_17,hypothesis,
follows(p7,p6),
transition_6_to_7 ).
cnf(c_0_18,hypothesis,
( succeeds(X1,p7)
| ~ succeeds(X1,p8) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,hypothesis,
succeeds(p3,p8),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,hypothesis,
follows(p6,p3),
transition_3_to_6 ).
cnf(c_0_21,hypothesis,
( succeeds(X1,p6)
| ~ succeeds(X1,p7) ),
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_22,hypothesis,
succeeds(p3,p7),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,hypothesis,
( succeeds(X1,p3)
| ~ succeeds(X1,p6) ),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_24,hypothesis,
succeeds(p3,p6),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
~ succeeds(p3,p3),
prove_there_is_a_loop_through_p3 ).
cnf(c_0_26,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COM002-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 29 12:57:39 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.18/0.58 start to proof: theBenchmark
% 0.18/0.60 % Version : CSE_E---1.5
% 0.18/0.60 % Problem : theBenchmark.p
% 0.18/0.60 % Proof found
% 0.18/0.60 % SZS status Theorem for theBenchmark.p
% 0.18/0.60 % SZS output start Proof
% See solution above
% 0.18/0.60 % Total time : 0.005000 s
% 0.18/0.60 % SZS output end Proof
% 0.18/0.60 % Total time : 0.008000 s
%------------------------------------------------------------------------------