TSTP Solution File: COM002-1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : COM002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n018.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 : 600s
% DateTime : Fri Jul 15 01:28:30 EDT 2022
% Result : Unsatisfiable 0.19s 0.41s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 46
% Syntax : Number of formulae : 118 ( 73 unt; 26 typ; 0 def)
% Number of atoms : 336 ( 92 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 488 ( 57 ~; 60 |; 0 &; 371 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 19 ( 19 >; 0 *; 0 +; 0 <<)
% Number of symbols : 29 ( 26 usr; 18 con; 0-2 aty)
% Number of variables : 107 ( 0 ^ 107 !; 0 ?; 107 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_assign,type,
assign: $i > $i > $i ).
thf(tp_equal_function,type,
equal_function: $i > $i > $i ).
thf(tp_follows,type,
follows: $i > $i > $o ).
thf(tp_goto,type,
goto: $i > $i ).
thf(tp_has,type,
has: $i > $i > $o ).
thf(tp_ifthen,type,
ifthen: $i > $i > $i ).
thf(tp_labels,type,
labels: $i > $i > $o ).
thf(tp_loop,type,
loop: $i ).
thf(tp_n,type,
n: $i ).
thf(tp_n0,type,
n0: $i ).
thf(tp_n1,type,
n1: $i ).
thf(tp_n2,type,
n2: $i ).
thf(tp_out,type,
out: $i ).
thf(tp_p1,type,
p1: $i ).
thf(tp_p2,type,
p2: $i ).
thf(tp_p3,type,
p3: $i ).
thf(tp_p4,type,
p4: $i ).
thf(tp_p5,type,
p5: $i ).
thf(tp_p6,type,
p6: $i ).
thf(tp_p7,type,
p7: $i ).
thf(tp_p8,type,
p8: $i ).
thf(tp_plus,type,
plus: $i > $i > $i ).
thf(tp_register_j,type,
register_j: $i ).
thf(tp_register_k,type,
register_k: $i ).
thf(tp_succeeds,type,
succeeds: $i > $i > $o ).
thf(tp_times,type,
times: $i > $i > $i ).
thf(1,axiom,
! [Goal_state: $i,Start_state: $i,Condition: $i] :
( ( succeeds @ Goal_state @ Start_state )
| ~ ( has @ Start_state @ ( ifthen @ Condition @ Goal_state ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conditional_success) ).
thf(2,axiom,
! [Goal_state: $i,Start_state: $i,Label: $i] :
( ( succeeds @ Goal_state @ Start_state )
| ~ ( has @ Start_state @ ( goto @ Label ) )
| ~ ( labels @ Label @ Goal_state ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goto_success) ).
thf(3,axiom,
! [Goal_state: $i,Start_state: $i,Intermediate_state: $i] :
( ( succeeds @ Goal_state @ Start_state )
| ~ ( succeeds @ Goal_state @ Intermediate_state )
| ~ ( succeeds @ Intermediate_state @ Start_state ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_success) ).
thf(4,axiom,
! [Goal_state: $i,Start_state: $i] :
( ( succeeds @ Goal_state @ Start_state )
| ~ ( follows @ Goal_state @ Start_state ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',direct_success) ).
thf(5,axiom,
has @ p8 @ ( goto @ loop ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_8) ).
thf(6,axiom,
follows @ p8 @ p7,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_7_to_8) ).
thf(7,axiom,
has @ p7 @ ( assign @ register_j @ ( plus @ register_j @ n1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_7) ).
thf(8,axiom,
follows @ p7 @ p6,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_6_to_7) ).
thf(9,axiom,
has @ p6 @ ( assign @ register_k @ ( times @ n2 @ register_k ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_6) ).
thf(10,axiom,
follows @ p6 @ p3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_3_to_6) ).
thf(11,axiom,
follows @ p5 @ p4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_4_to_5) ).
thf(12,axiom,
has @ p4 @ ( goto @ out ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_4) ).
thf(13,axiom,
has @ p3 @ ( ifthen @ ( equal_function @ register_j @ n ) @ p4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_3) ).
thf(14,axiom,
follows @ p3 @ p2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_2_to_3) ).
thf(15,axiom,
labels @ loop @ p3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',label_state_3) ).
thf(16,axiom,
has @ p2 @ ( assign @ register_k @ n1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_2) ).
thf(17,axiom,
follows @ p2 @ p1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_1_to_2) ).
thf(18,axiom,
has @ p1 @ ( assign @ register_j @ n0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_1) ).
thf(19,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(20,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[19]) ).
thf(21,negated_conjecture,
~ ( succeeds @ p3 @ p3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).
thf(22,plain,
$false = $false,
inference(unfold_def,[status(thm)],[20]) ).
thf(23,plain,
( ( ! [Goal_state: $i,Start_state: $i,Condition: $i] :
( ( succeeds @ Goal_state @ Start_state )
| ~ ( has @ Start_state @ ( ifthen @ Condition @ Goal_state ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(24,plain,
( ( ! [Goal_state: $i,Start_state: $i,Label: $i] :
( ( succeeds @ Goal_state @ Start_state )
| ~ ( has @ Start_state @ ( goto @ Label ) )
| ~ ( labels @ Label @ Goal_state ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(25,plain,
( ( ! [Goal_state: $i,Start_state: $i,Intermediate_state: $i] :
( ( succeeds @ Goal_state @ Start_state )
| ~ ( succeeds @ Goal_state @ Intermediate_state )
| ~ ( succeeds @ Intermediate_state @ Start_state ) ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(26,plain,
( ( ! [Goal_state: $i,Start_state: $i] :
( ( succeeds @ Goal_state @ Start_state )
| ~ ( follows @ Goal_state @ Start_state ) ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(27,plain,
( ( has @ p8 @ ( goto @ loop ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(28,plain,
( ( follows @ p8 @ p7 )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(29,plain,
( ( has @ p7 @ ( assign @ register_j @ ( plus @ register_j @ n1 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[7]) ).
thf(30,plain,
( ( follows @ p7 @ p6 )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(31,plain,
( ( has @ p6 @ ( assign @ register_k @ ( times @ n2 @ register_k ) ) )
= $true ),
inference(unfold_def,[status(thm)],[9]) ).
thf(32,plain,
( ( follows @ p6 @ p3 )
= $true ),
inference(unfold_def,[status(thm)],[10]) ).
thf(33,plain,
( ( follows @ p5 @ p4 )
= $true ),
inference(unfold_def,[status(thm)],[11]) ).
thf(34,plain,
( ( has @ p4 @ ( goto @ out ) )
= $true ),
inference(unfold_def,[status(thm)],[12]) ).
thf(35,plain,
( ( has @ p3 @ ( ifthen @ ( equal_function @ register_j @ n ) @ p4 ) )
= $true ),
inference(unfold_def,[status(thm)],[13]) ).
thf(36,plain,
( ( follows @ p3 @ p2 )
= $true ),
inference(unfold_def,[status(thm)],[14]) ).
thf(37,plain,
( ( labels @ loop @ p3 )
= $true ),
inference(unfold_def,[status(thm)],[15]) ).
thf(38,plain,
( ( has @ p2 @ ( assign @ register_k @ n1 ) )
= $true ),
inference(unfold_def,[status(thm)],[16]) ).
thf(39,plain,
( ( follows @ p2 @ p1 )
= $true ),
inference(unfold_def,[status(thm)],[17]) ).
thf(40,plain,
( ( has @ p1 @ ( assign @ register_j @ n0 ) )
= $true ),
inference(unfold_def,[status(thm)],[18]) ).
thf(41,plain,
( ( ~ ( succeeds @ p3 @ p3 ) )
= $true ),
inference(unfold_def,[status(thm)],[21]) ).
thf(42,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[22]) ).
thf(43,plain,
( ( ! [Goal_state: $i,Start_state: $i] :
( ( succeeds @ Goal_state @ Start_state )
| ! [Condition: $i] :
~ ( has @ Start_state @ ( ifthen @ Condition @ Goal_state ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[23]) ).
thf(44,plain,
( ( ! [Goal_state: $i,Start_state: $i] :
( ( succeeds @ Goal_state @ Start_state )
| ! [Label: $i] :
( ~ ( has @ Start_state @ ( goto @ Label ) )
| ~ ( labels @ Label @ Goal_state ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[24]) ).
thf(45,plain,
( ( ! [Goal_state: $i,Start_state: $i] :
( ( succeeds @ Goal_state @ Start_state )
| ! [Intermediate_state: $i] :
( ~ ( succeeds @ Goal_state @ Intermediate_state )
| ~ ( succeeds @ Intermediate_state @ Start_state ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[25]) ).
thf(46,plain,
( ( ~ ( succeeds @ p3 @ p3 ) )
= $true ),
inference(copy,[status(thm)],[41]) ).
thf(47,plain,
( ( has @ p1 @ ( assign @ register_j @ n0 ) )
= $true ),
inference(copy,[status(thm)],[40]) ).
thf(48,plain,
( ( follows @ p2 @ p1 )
= $true ),
inference(copy,[status(thm)],[39]) ).
thf(49,plain,
( ( has @ p2 @ ( assign @ register_k @ n1 ) )
= $true ),
inference(copy,[status(thm)],[38]) ).
thf(50,plain,
( ( labels @ loop @ p3 )
= $true ),
inference(copy,[status(thm)],[37]) ).
thf(51,plain,
( ( follows @ p3 @ p2 )
= $true ),
inference(copy,[status(thm)],[36]) ).
thf(52,plain,
( ( has @ p3 @ ( ifthen @ ( equal_function @ register_j @ n ) @ p4 ) )
= $true ),
inference(copy,[status(thm)],[35]) ).
thf(53,plain,
( ( has @ p4 @ ( goto @ out ) )
= $true ),
inference(copy,[status(thm)],[34]) ).
thf(54,plain,
( ( follows @ p5 @ p4 )
= $true ),
inference(copy,[status(thm)],[33]) ).
thf(55,plain,
( ( follows @ p6 @ p3 )
= $true ),
inference(copy,[status(thm)],[32]) ).
thf(56,plain,
( ( has @ p6 @ ( assign @ register_k @ ( times @ n2 @ register_k ) ) )
= $true ),
inference(copy,[status(thm)],[31]) ).
thf(57,plain,
( ( follows @ p7 @ p6 )
= $true ),
inference(copy,[status(thm)],[30]) ).
thf(58,plain,
( ( has @ p7 @ ( assign @ register_j @ ( plus @ register_j @ n1 ) ) )
= $true ),
inference(copy,[status(thm)],[29]) ).
thf(59,plain,
( ( follows @ p8 @ p7 )
= $true ),
inference(copy,[status(thm)],[28]) ).
thf(60,plain,
( ( has @ p8 @ ( goto @ loop ) )
= $true ),
inference(copy,[status(thm)],[27]) ).
thf(61,plain,
( ( ! [Goal_state: $i,Start_state: $i] :
( ( succeeds @ Goal_state @ Start_state )
| ~ ( follows @ Goal_state @ Start_state ) ) )
= $true ),
inference(copy,[status(thm)],[26]) ).
thf(62,plain,
( ( ! [Goal_state: $i,Start_state: $i] :
( ( succeeds @ Goal_state @ Start_state )
| ! [Intermediate_state: $i] :
( ~ ( succeeds @ Goal_state @ Intermediate_state )
| ~ ( succeeds @ Intermediate_state @ Start_state ) ) ) )
= $true ),
inference(copy,[status(thm)],[45]) ).
thf(63,plain,
( ( ! [Goal_state: $i,Start_state: $i] :
( ( succeeds @ Goal_state @ Start_state )
| ! [Label: $i] :
( ~ ( has @ Start_state @ ( goto @ Label ) )
| ~ ( labels @ Label @ Goal_state ) ) ) )
= $true ),
inference(copy,[status(thm)],[44]) ).
thf(64,plain,
( ( ! [Goal_state: $i,Start_state: $i] :
( ( succeeds @ Goal_state @ Start_state )
| ! [Condition: $i] :
~ ( has @ Start_state @ ( ifthen @ Condition @ Goal_state ) ) ) )
= $true ),
inference(copy,[status(thm)],[43]) ).
thf(65,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[42]) ).
thf(66,plain,
( ( succeeds @ p3 @ p3 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[46]) ).
thf(67,plain,
! [SV1: $i] :
( ( ! [SY11: $i] :
( ( succeeds @ SV1 @ SY11 )
| ~ ( follows @ SV1 @ SY11 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[61]) ).
thf(68,plain,
! [SV2: $i] :
( ( ! [SY12: $i] :
( ( succeeds @ SV2 @ SY12 )
| ! [SY13: $i] :
( ~ ( succeeds @ SV2 @ SY13 )
| ~ ( succeeds @ SY13 @ SY12 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[62]) ).
thf(69,plain,
! [SV3: $i] :
( ( ! [SY14: $i] :
( ( succeeds @ SV3 @ SY14 )
| ! [SY15: $i] :
( ~ ( has @ SY14 @ ( goto @ SY15 ) )
| ~ ( labels @ SY15 @ SV3 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[63]) ).
thf(70,plain,
! [SV4: $i] :
( ( ! [SY16: $i] :
( ( succeeds @ SV4 @ SY16 )
| ! [SY17: $i] :
~ ( has @ SY16 @ ( ifthen @ SY17 @ SV4 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[64]) ).
thf(71,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[65]) ).
thf(72,plain,
! [SV5: $i,SV1: $i] :
( ( ( succeeds @ SV1 @ SV5 )
| ~ ( follows @ SV1 @ SV5 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[67]) ).
thf(73,plain,
! [SV6: $i,SV2: $i] :
( ( ( succeeds @ SV2 @ SV6 )
| ! [SY18: $i] :
( ~ ( succeeds @ SV2 @ SY18 )
| ~ ( succeeds @ SY18 @ SV6 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[68]) ).
thf(74,plain,
! [SV7: $i,SV3: $i] :
( ( ( succeeds @ SV3 @ SV7 )
| ! [SY19: $i] :
( ~ ( has @ SV7 @ ( goto @ SY19 ) )
| ~ ( labels @ SY19 @ SV3 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[69]) ).
thf(75,plain,
! [SV8: $i,SV4: $i] :
( ( ( succeeds @ SV4 @ SV8 )
| ! [SY20: $i] :
~ ( has @ SV8 @ ( ifthen @ SY20 @ SV4 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[70]) ).
thf(76,plain,
! [SV5: $i,SV1: $i] :
( ( ( succeeds @ SV1 @ SV5 )
= $true )
| ( ( ~ ( follows @ SV1 @ SV5 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[72]) ).
thf(77,plain,
! [SV6: $i,SV2: $i] :
( ( ( succeeds @ SV2 @ SV6 )
= $true )
| ( ( ! [SY18: $i] :
( ~ ( succeeds @ SV2 @ SY18 )
| ~ ( succeeds @ SY18 @ SV6 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[73]) ).
thf(78,plain,
! [SV7: $i,SV3: $i] :
( ( ( succeeds @ SV3 @ SV7 )
= $true )
| ( ( ! [SY19: $i] :
( ~ ( has @ SV7 @ ( goto @ SY19 ) )
| ~ ( labels @ SY19 @ SV3 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[74]) ).
thf(79,plain,
! [SV8: $i,SV4: $i] :
( ( ( succeeds @ SV4 @ SV8 )
= $true )
| ( ( ! [SY20: $i] :
~ ( has @ SV8 @ ( ifthen @ SY20 @ SV4 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[75]) ).
thf(80,plain,
! [SV5: $i,SV1: $i] :
( ( ( follows @ SV1 @ SV5 )
= $false )
| ( ( succeeds @ SV1 @ SV5 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[76]) ).
thf(81,plain,
! [SV6: $i,SV9: $i,SV2: $i] :
( ( ( ~ ( succeeds @ SV2 @ SV9 )
| ~ ( succeeds @ SV9 @ SV6 ) )
= $true )
| ( ( succeeds @ SV2 @ SV6 )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[77]) ).
thf(82,plain,
! [SV3: $i,SV10: $i,SV7: $i] :
( ( ( ~ ( has @ SV7 @ ( goto @ SV10 ) )
| ~ ( labels @ SV10 @ SV3 ) )
= $true )
| ( ( succeeds @ SV3 @ SV7 )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[78]) ).
thf(83,plain,
! [SV4: $i,SV11: $i,SV8: $i] :
( ( ( ~ ( has @ SV8 @ ( ifthen @ SV11 @ SV4 ) ) )
= $true )
| ( ( succeeds @ SV4 @ SV8 )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[79]) ).
thf(84,plain,
! [SV6: $i,SV9: $i,SV2: $i] :
( ( ( ~ ( succeeds @ SV2 @ SV9 ) )
= $true )
| ( ( ~ ( succeeds @ SV9 @ SV6 ) )
= $true )
| ( ( succeeds @ SV2 @ SV6 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[81]) ).
thf(85,plain,
! [SV3: $i,SV10: $i,SV7: $i] :
( ( ( ~ ( has @ SV7 @ ( goto @ SV10 ) ) )
= $true )
| ( ( ~ ( labels @ SV10 @ SV3 ) )
= $true )
| ( ( succeeds @ SV3 @ SV7 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[82]) ).
thf(86,plain,
! [SV4: $i,SV11: $i,SV8: $i] :
( ( ( has @ SV8 @ ( ifthen @ SV11 @ SV4 ) )
= $false )
| ( ( succeeds @ SV4 @ SV8 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[83]) ).
thf(87,plain,
! [SV6: $i,SV9: $i,SV2: $i] :
( ( ( succeeds @ SV2 @ SV9 )
= $false )
| ( ( ~ ( succeeds @ SV9 @ SV6 ) )
= $true )
| ( ( succeeds @ SV2 @ SV6 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[84]) ).
thf(88,plain,
! [SV3: $i,SV10: $i,SV7: $i] :
( ( ( has @ SV7 @ ( goto @ SV10 ) )
= $false )
| ( ( ~ ( labels @ SV10 @ SV3 ) )
= $true )
| ( ( succeeds @ SV3 @ SV7 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[85]) ).
thf(89,plain,
! [SV2: $i,SV6: $i,SV9: $i] :
( ( ( succeeds @ SV9 @ SV6 )
= $false )
| ( ( succeeds @ SV2 @ SV9 )
= $false )
| ( ( succeeds @ SV2 @ SV6 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[87]) ).
thf(90,plain,
! [SV7: $i,SV3: $i,SV10: $i] :
( ( ( labels @ SV10 @ SV3 )
= $false )
| ( ( has @ SV7 @ ( goto @ SV10 ) )
= $false )
| ( ( succeeds @ SV3 @ SV7 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[88]) ).
thf(91,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[47,90,89,86,80,71,66,60,59,58,57,56,55,54,53,52,51,50,49,48]) ).
thf(92,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[91]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : COM002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 18:09:01 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35
% 0.12/0.35 No.of.Axioms: 19
% 0.12/0.35
% 0.12/0.35 Length.of.Defs: 0
% 0.12/0.35
% 0.12/0.35 Contains.Choice.Funs: false
% 0.12/0.35 (rf:0,axioms:19,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:600,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:21,loop_count:0,foatp_calls:0,translation:fof_full)...
% 0.19/0.41
% 0.19/0.41 ********************************
% 0.19/0.41 * All subproblems solved! *
% 0.19/0.41 ********************************
% 0.19/0.41 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:19,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:91,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.19/0.41
% 0.19/0.41 %**** Beginning of derivation protocol ****
% 0.19/0.41 % SZS output start CNFRefutation
% See solution above
% 0.19/0.41
% 0.19/0.41 %**** End of derivation protocol ****
% 0.19/0.41 %**** no. of clauses in derivation: 92 ****
% 0.19/0.41 %**** clause counter: 91 ****
% 0.19/0.41
% 0.19/0.41 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:19,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:91,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------