%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SWV011+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n024.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 : Wed Jul 20 19:07:01 EDT 2022
% Result : Theorem 0.20s 0.43s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named input)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
fof(ax6,axiom,
b_stored(pair(a,an_a_nonce)),
input ).
fof(ax6_0,plain,
( b_stored(pair(a,an_a_nonce))
| $false ),
inference(orientation,[status(thm)],[ax6]) ).
fof(ax5,axiom,
message(sent(b,t,triple(b,generate_b_nonce(an_a_nonce),encrypt(triple(a,an_a_nonce,generate_expiration_time(an_a_nonce)),bt)))),
input ).
fof(ax5_0,plain,
( message(sent(b,t,triple(b,generate_b_nonce(an_a_nonce),encrypt(triple(a,an_a_nonce,generate_expiration_time(an_a_nonce)),bt))))
| $false ),
inference(orientation,[status(thm)],[ax5]) ).
fof(ax4,axiom,
message(sent(t,a,triple(encrypt(quadruple(b,an_a_nonce,generate_key(an_a_nonce),generate_expiration_time(an_a_nonce)),at),encrypt(triple(a,generate_key(an_a_nonce),generate_expiration_time(an_a_nonce)),bt),generate_b_nonce(an_a_nonce)))),
input ).
fof(ax4_0,plain,
( message(sent(t,a,triple(encrypt(quadruple(b,an_a_nonce,generate_key(an_a_nonce),generate_expiration_time(an_a_nonce)),at),encrypt(triple(a,generate_key(an_a_nonce),generate_expiration_time(an_a_nonce)),bt),generate_b_nonce(an_a_nonce))))
| $false ),
inference(orientation,[status(thm)],[ax4]) ).
fof(ax3,axiom,
a_holds(key(generate_key(an_a_nonce),b)),
input ).
fof(ax3_0,plain,
( a_holds(key(generate_key(an_a_nonce),b))
| $false ),
inference(orientation,[status(thm)],[ax3]) ).
fof(ax2,axiom,
message(sent(a,b,pair(encrypt(triple(a,generate_key(an_a_nonce),generate_expiration_time(an_a_nonce)),bt),encrypt(generate_b_nonce(an_a_nonce),generate_key(an_a_nonce))))),
input ).
fof(ax2_0,plain,
( message(sent(a,b,pair(encrypt(triple(a,generate_key(an_a_nonce),generate_expiration_time(an_a_nonce)),bt),encrypt(generate_b_nonce(an_a_nonce),generate_key(an_a_nonce)))))
| $false ),
inference(orientation,[status(thm)],[ax2]) ).
fof(ax1,axiom,
b_holds(key(generate_key(an_a_nonce),a)),
input ).
fof(ax1_0,plain,
( b_holds(key(generate_key(an_a_nonce),a))
| $false ),
inference(orientation,[status(thm)],[ax1]) ).
fof(t_is_party_of_protocol,axiom,
party_of_protocol(t),
input ).
fof(t_is_party_of_protocol_0,plain,
( party_of_protocol(t)
| $false ),
inference(orientation,[status(thm)],[t_is_party_of_protocol]) ).
fof(t_holds_key_bt_for_b,axiom,
t_holds(key(bt,b)),
input ).
fof(t_holds_key_bt_for_b_0,plain,
( t_holds(key(bt,b))
| $false ),
inference(orientation,[status(thm)],[t_holds_key_bt_for_b]) ).
fof(t_holds_key_at_for_a,axiom,
t_holds(key(at,a)),
input ).
fof(t_holds_key_at_for_a_0,plain,
( t_holds(key(at,a))
| $false ),
inference(orientation,[status(thm)],[t_holds_key_at_for_a]) ).
fof(nonce_a_is_fresh_to_b,axiom,
fresh_to_b(an_a_nonce),
input ).
fof(nonce_a_is_fresh_to_b_0,plain,
( fresh_to_b(an_a_nonce)
| $false ),
inference(orientation,[status(thm)],[nonce_a_is_fresh_to_b]) ).
fof(b_is_party_of_protocol,axiom,
party_of_protocol(b),
input ).
fof(b_is_party_of_protocol_0,plain,
( party_of_protocol(b)
| $false ),
inference(orientation,[status(thm)],[b_is_party_of_protocol]) ).
fof(b_hold_key_bt_for_t,axiom,
b_holds(key(bt,t)),
input ).
fof(b_hold_key_bt_for_t_0,plain,
( b_holds(key(bt,t))
| $false ),
inference(orientation,[status(thm)],[b_hold_key_bt_for_t]) ).
fof(a_stored_message_i,axiom,
a_stored(pair(b,an_a_nonce)),
input ).
fof(a_stored_message_i_0,plain,
( a_stored(pair(b,an_a_nonce))
| $false ),
inference(orientation,[status(thm)],[a_stored_message_i]) ).
fof(a_sent_message_i_to_b,axiom,
message(sent(a,b,pair(a,an_a_nonce))),
input ).
fof(a_sent_message_i_to_b_0,plain,
( message(sent(a,b,pair(a,an_a_nonce)))
| $false ),
inference(orientation,[status(thm)],[a_sent_message_i_to_b]) ).
fof(a_is_party_of_protocol,axiom,
party_of_protocol(a),
input ).
fof(a_is_party_of_protocol_0,plain,
( party_of_protocol(a)
| $false ),
inference(orientation,[status(thm)],[a_is_party_of_protocol]) ).
fof(a_holds_key_at_for_t,axiom,
a_holds(key(at,t)),
input ).
fof(a_holds_key_at_for_t_0,plain,
( a_holds(key(at,t))
| $false ),
inference(orientation,[status(thm)],[a_holds_key_at_for_t]) ).
fof(def_lhs_atom1,axiom,
( lhs_atom1
<=> a_holds(key(at,t)) ),
inference(definition,[],[]) ).
fof(to_be_clausified_0,plain,
( lhs_atom1
| $false ),
inference(fold_definition,[status(thm)],[a_holds_key_at_for_t_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
( lhs_atom2
<=> party_of_protocol(a) ),
inference(definition,[],[]) ).
fof(to_be_clausified_1,plain,
( lhs_atom2
| $false ),
inference(fold_definition,[status(thm)],[a_is_party_of_protocol_0,def_lhs_atom2]) ).
fof(def_lhs_atom3,axiom,
( lhs_atom3
<=> message(sent(a,b,pair(a,an_a_nonce))) ),
inference(definition,[],[]) ).
fof(to_be_clausified_2,plain,
( lhs_atom3
| $false ),
inference(fold_definition,[status(thm)],[a_sent_message_i_to_b_0,def_lhs_atom3]) ).
fof(def_lhs_atom4,axiom,
( lhs_atom4
<=> a_stored(pair(b,an_a_nonce)) ),
inference(definition,[],[]) ).
fof(to_be_clausified_3,plain,
( lhs_atom4
| $false ),
inference(fold_definition,[status(thm)],[a_stored_message_i_0,def_lhs_atom4]) ).
fof(def_lhs_atom5,axiom,
( lhs_atom5
<=> b_holds(key(bt,t)) ),
inference(definition,[],[]) ).
fof(to_be_clausified_4,plain,
( lhs_atom5
| $false ),
inference(fold_definition,[status(thm)],[b_hold_key_bt_for_t_0,def_lhs_atom5]) ).
fof(def_lhs_atom6,axiom,
( lhs_atom6
<=> party_of_protocol(b) ),
inference(definition,[],[]) ).
fof(to_be_clausified_5,plain,
( lhs_atom6
| $false ),
inference(fold_definition,[status(thm)],[b_is_party_of_protocol_0,def_lhs_atom6]) ).
fof(def_lhs_atom7,axiom,
( lhs_atom7
<=> fresh_to_b(an_a_nonce) ),
inference(definition,[],[]) ).
fof(to_be_clausified_6,plain,
( lhs_atom7
| $false ),
inference(fold_definition,[status(thm)],[nonce_a_is_fresh_to_b_0,def_lhs_atom7]) ).
fof(def_lhs_atom8,axiom,
( lhs_atom8
<=> t_holds(key(at,a)) ),
inference(definition,[],[]) ).
fof(to_be_clausified_7,plain,
( lhs_atom8
| $false ),
inference(fold_definition,[status(thm)],[t_holds_key_at_for_a_0,def_lhs_atom8]) ).
fof(def_lhs_atom9,axiom,
( lhs_atom9
<=> t_holds(key(bt,b)) ),
inference(definition,[],[]) ).
fof(to_be_clausified_8,plain,
( lhs_atom9
| $false ),
inference(fold_definition,[status(thm)],[t_holds_key_bt_for_b_0,def_lhs_atom9]) ).
fof(def_lhs_atom10,axiom,
( lhs_atom10
<=> party_of_protocol(t) ),
inference(definition,[],[]) ).
fof(to_be_clausified_9,plain,
( lhs_atom10
| $false ),
inference(fold_definition,[status(thm)],[t_is_party_of_protocol_0,def_lhs_atom10]) ).
fof(def_lhs_atom11,axiom,
( lhs_atom11
<=> b_holds(key(generate_key(an_a_nonce),a)) ),
inference(definition,[],[]) ).
fof(to_be_clausified_10,plain,
( lhs_atom11
| $false ),
inference(fold_definition,[status(thm)],[ax1_0,def_lhs_atom11]) ).
fof(def_lhs_atom12,axiom,
( lhs_atom12
<=> message(sent(a,b,pair(encrypt(triple(a,generate_key(an_a_nonce),generate_expiration_time(an_a_nonce)),bt),encrypt(generate_b_nonce(an_a_nonce),generate_key(an_a_nonce))))) ),
inference(definition,[],[]) ).
fof(to_be_clausified_11,plain,
( lhs_atom12
| $false ),
inference(fold_definition,[status(thm)],[ax2_0,def_lhs_atom12]) ).
fof(def_lhs_atom13,axiom,
( lhs_atom13
<=> a_holds(key(generate_key(an_a_nonce),b)) ),
inference(definition,[],[]) ).
fof(to_be_clausified_12,plain,
( lhs_atom13
| $false ),
inference(fold_definition,[status(thm)],[ax3_0,def_lhs_atom13]) ).
fof(def_lhs_atom14,axiom,
( lhs_atom14
<=> message(sent(t,a,triple(encrypt(quadruple(b,an_a_nonce,generate_key(an_a_nonce),generate_expiration_time(an_a_nonce)),at),encrypt(triple(a,generate_key(an_a_nonce),generate_expiration_time(an_a_nonce)),bt),generate_b_nonce(an_a_nonce)))) ),
inference(definition,[],[]) ).
fof(to_be_clausified_13,plain,
( lhs_atom14
| $false ),
inference(fold_definition,[status(thm)],[ax4_0,def_lhs_atom14]) ).
fof(def_lhs_atom15,axiom,
( lhs_atom15
<=> message(sent(b,t,triple(b,generate_b_nonce(an_a_nonce),encrypt(triple(a,an_a_nonce,generate_expiration_time(an_a_nonce)),bt)))) ),
inference(definition,[],[]) ).
fof(to_be_clausified_14,plain,
( lhs_atom15
| $false ),
inference(fold_definition,[status(thm)],[ax5_0,def_lhs_atom15]) ).
fof(def_lhs_atom16,axiom,
( lhs_atom16
<=> b_stored(pair(a,an_a_nonce)) ),
inference(definition,[],[]) ).
fof(to_be_clausified_15,plain,
( lhs_atom16
| $false ),
inference(fold_definition,[status(thm)],[ax6_0,def_lhs_atom16]) ).
% Start CNF derivation
fof(c_0_0,axiom,
( lhs_atom16
| ~ $true ),
file('<stdin>',to_be_clausified_15) ).
fof(c_0_1,axiom,
( lhs_atom15
| ~ $true ),
file('<stdin>',to_be_clausified_14) ).
fof(c_0_2,axiom,
( lhs_atom14
| ~ $true ),
file('<stdin>',to_be_clausified_13) ).
fof(c_0_3,axiom,
( lhs_atom13
| ~ $true ),
file('<stdin>',to_be_clausified_12) ).
fof(c_0_4,axiom,
( lhs_atom12
| ~ $true ),
file('<stdin>',to_be_clausified_11) ).
fof(c_0_5,axiom,
( lhs_atom11
| ~ $true ),
file('<stdin>',to_be_clausified_10) ).
fof(c_0_6,axiom,
( lhs_atom10
| ~ $true ),
file('<stdin>',to_be_clausified_9) ).
fof(c_0_7,axiom,
( lhs_atom9
| ~ $true ),
file('<stdin>',to_be_clausified_8) ).
fof(c_0_8,axiom,
( lhs_atom8
| ~ $true ),
file('<stdin>',to_be_clausified_7) ).
fof(c_0_9,axiom,
( lhs_atom7
| ~ $true ),
file('<stdin>',to_be_clausified_6) ).
fof(c_0_10,axiom,
( lhs_atom6
| ~ $true ),
file('<stdin>',to_be_clausified_5) ).
fof(c_0_11,axiom,
( lhs_atom5
| ~ $true ),
file('<stdin>',to_be_clausified_4) ).
fof(c_0_12,axiom,
( lhs_atom4
| ~ $true ),
file('<stdin>',to_be_clausified_3) ).
fof(c_0_13,axiom,
( lhs_atom3
| ~ $true ),
file('<stdin>',to_be_clausified_2) ).
fof(c_0_14,axiom,
( lhs_atom2
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_15,axiom,
( lhs_atom1
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_16,plain,
lhs_atom16,
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_17,plain,
lhs_atom15,
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_18,plain,
lhs_atom14,
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_19,plain,
lhs_atom13,
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_20,plain,
lhs_atom12,
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_21,plain,
lhs_atom11,
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_22,plain,
lhs_atom10,
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_23,plain,
lhs_atom9,
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_24,plain,
lhs_atom8,
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_25,plain,
lhs_atom7,
inference(fof_simplification,[status(thm)],[c_0_9]) ).
fof(c_0_26,plain,
lhs_atom6,
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_27,plain,
lhs_atom5,
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_28,plain,
lhs_atom4,
inference(fof_simplification,[status(thm)],[c_0_12]) ).
fof(c_0_29,plain,
lhs_atom3,
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_30,plain,
lhs_atom2,
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_31,plain,
lhs_atom1,
inference(fof_simplification,[status(thm)],[c_0_15]) ).
fof(c_0_32,plain,
lhs_atom16,
c_0_16 ).
fof(c_0_33,plain,
lhs_atom15,
c_0_17 ).
fof(c_0_34,plain,
lhs_atom14,
c_0_18 ).
fof(c_0_35,plain,
lhs_atom13,
c_0_19 ).
fof(c_0_36,plain,
lhs_atom12,
c_0_20 ).
fof(c_0_37,plain,
lhs_atom11,
c_0_21 ).
fof(c_0_38,plain,
lhs_atom10,
c_0_22 ).
fof(c_0_39,plain,
lhs_atom9,
c_0_23 ).
fof(c_0_40,plain,
lhs_atom8,
c_0_24 ).
fof(c_0_41,plain,
lhs_atom7,
c_0_25 ).
fof(c_0_42,plain,
lhs_atom6,
c_0_26 ).
fof(c_0_43,plain,
lhs_atom5,
c_0_27 ).
fof(c_0_44,plain,
lhs_atom4,
c_0_28 ).
fof(c_0_45,plain,
lhs_atom3,
c_0_29 ).
fof(c_0_46,plain,
lhs_atom2,
c_0_30 ).
fof(c_0_47,plain,
lhs_atom1,
c_0_31 ).
cnf(c_0_48,plain,
lhs_atom16,
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_49,plain,
lhs_atom15,
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_50,plain,
lhs_atom14,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_51,plain,
lhs_atom13,
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_52,plain,
lhs_atom12,
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_53,plain,
lhs_atom11,
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_54,plain,
lhs_atom10,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_55,plain,
lhs_atom9,
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_56,plain,
lhs_atom8,
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_57,plain,
lhs_atom7,
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_58,plain,
lhs_atom6,
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_59,plain,
lhs_atom5,
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_60,plain,
lhs_atom4,
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_61,plain,
lhs_atom3,
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_62,plain,
lhs_atom2,
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_63,plain,
lhs_atom1,
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_64,plain,
lhs_atom16,
c_0_48,
[final] ).
cnf(c_0_65,plain,
lhs_atom15,
c_0_49,
[final] ).
cnf(c_0_66,plain,
lhs_atom14,
c_0_50,
[final] ).
cnf(c_0_67,plain,
lhs_atom13,
c_0_51,
[final] ).
cnf(c_0_68,plain,
lhs_atom12,
c_0_52,
[final] ).
cnf(c_0_69,plain,
lhs_atom11,
c_0_53,
[final] ).
cnf(c_0_70,plain,
lhs_atom10,
c_0_54,
[final] ).
cnf(c_0_71,plain,
lhs_atom9,
c_0_55,
[final] ).
cnf(c_0_72,plain,
lhs_atom8,
c_0_56,
[final] ).
cnf(c_0_73,plain,
lhs_atom7,
c_0_57,
[final] ).
cnf(c_0_74,plain,
lhs_atom6,
c_0_58,
[final] ).
cnf(c_0_75,plain,
lhs_atom5,
c_0_59,
[final] ).
cnf(c_0_76,plain,
lhs_atom4,
c_0_60,
[final] ).
cnf(c_0_77,plain,
lhs_atom3,
c_0_61,
[final] ).
cnf(c_0_78,plain,
lhs_atom2,
c_0_62,
[final] ).
cnf(c_0_79,plain,
lhs_atom1,
c_0_63,
[final] ).
% End CNF derivation
cnf(c_0_64_0,axiom,
b_stored(pair(a,an_a_nonce)),
inference(unfold_definition,[status(thm)],[c_0_64,def_lhs_atom16]) ).
cnf(c_0_65_0,axiom,
message(sent(b,t,triple(b,generate_b_nonce(an_a_nonce),encrypt(triple(a,an_a_nonce,generate_expiration_time(an_a_nonce)),bt)))),
inference(unfold_definition,[status(thm)],[c_0_65,def_lhs_atom15]) ).
cnf(c_0_66_0,axiom,
message(sent(t,a,triple(encrypt(quadruple(b,an_a_nonce,generate_key(an_a_nonce),generate_expiration_time(an_a_nonce)),at),encrypt(triple(a,generate_key(an_a_nonce),generate_expiration_time(an_a_nonce)),bt),generate_b_nonce(an_a_nonce)))),
inference(unfold_definition,[status(thm)],[c_0_66,def_lhs_atom14]) ).
cnf(c_0_67_0,axiom,
a_holds(key(generate_key(an_a_nonce),b)),
inference(unfold_definition,[status(thm)],[c_0_67,def_lhs_atom13]) ).
cnf(c_0_68_0,axiom,
message(sent(a,b,pair(encrypt(triple(a,generate_key(an_a_nonce),generate_expiration_time(an_a_nonce)),bt),encrypt(generate_b_nonce(an_a_nonce),generate_key(an_a_nonce))))),
inference(unfold_definition,[status(thm)],[c_0_68,def_lhs_atom12]) ).
cnf(c_0_69_0,axiom,
b_holds(key(generate_key(an_a_nonce),a)),
inference(unfold_definition,[status(thm)],[c_0_69,def_lhs_atom11]) ).
cnf(c_0_70_0,axiom,
party_of_protocol(t),
inference(unfold_definition,[status(thm)],[c_0_70,def_lhs_atom10]) ).
cnf(c_0_71_0,axiom,
t_holds(key(bt,b)),
inference(unfold_definition,[status(thm)],[c_0_71,def_lhs_atom9]) ).
cnf(c_0_72_0,axiom,
t_holds(key(at,a)),
inference(unfold_definition,[status(thm)],[c_0_72,def_lhs_atom8]) ).
cnf(c_0_73_0,axiom,
fresh_to_b(an_a_nonce),
inference(unfold_definition,[status(thm)],[c_0_73,def_lhs_atom7]) ).
cnf(c_0_74_0,axiom,
party_of_protocol(b),
inference(unfold_definition,[status(thm)],[c_0_74,def_lhs_atom6]) ).
cnf(c_0_75_0,axiom,
b_holds(key(bt,t)),
inference(unfold_definition,[status(thm)],[c_0_75,def_lhs_atom5]) ).
cnf(c_0_76_0,axiom,
a_stored(pair(b,an_a_nonce)),
inference(unfold_definition,[status(thm)],[c_0_76,def_lhs_atom4]) ).
cnf(c_0_77_0,axiom,
message(sent(a,b,pair(a,an_a_nonce))),
inference(unfold_definition,[status(thm)],[c_0_77,def_lhs_atom3]) ).
cnf(c_0_78_0,axiom,
party_of_protocol(a),
inference(unfold_definition,[status(thm)],[c_0_78,def_lhs_atom2]) ).
cnf(c_0_79_0,axiom,
a_holds(key(at,t)),
inference(unfold_definition,[status(thm)],[c_0_79,def_lhs_atom1]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_001,conjecture,
? [X1] :
( a_holds(key(X1,b))
& b_holds(key(X1,a)) ),
file('<stdin>',co1) ).
fof(c_0_1_002,negated_conjecture,
~ ? [X1] :
( a_holds(key(X1,b))
& b_holds(key(X1,a)) ),
inference(assume_negation,[status(cth)],[c_0_0]) ).
fof(c_0_2_003,negated_conjecture,
! [X2] :
( ~ a_holds(key(X2,b))
| ~ b_holds(key(X2,a)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])]) ).
cnf(c_0_3_004,negated_conjecture,
( ~ b_holds(key(X1,a))
| ~ a_holds(key(X1,b)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,negated_conjecture,
( ~ b_holds(key(X1,a))
| ~ a_holds(key(X1,b)) ),
c_0_3,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_16,negated_conjecture,
( ~ a_holds(key(X0,b))
| ~ b_holds(key(X0,a)) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_f9f8f1.p',c_0_4) ).
cnf(c_18,negated_conjecture,
( ~ a_holds(key(X0,b))
| ~ b_holds(key(X0,a)) ),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_22,negated_conjecture,
( ~ a_holds(key(X0,b))
| ~ b_holds(key(X0,a)) ),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_23,negated_conjecture,
( ~ a_holds(key(X0,b))
| ~ b_holds(key(X0,a)) ),
inference(copy,[status(esa)],[c_22]) ).
cnf(c_24,negated_conjecture,
( ~ a_holds(key(X0,b))
| ~ b_holds(key(X0,a)) ),
inference(copy,[status(esa)],[c_23]) ).
cnf(c_74,negated_conjecture,
( ~ a_holds(key(X0,b))
| ~ b_holds(key(X0,a)) ),
inference(copy,[status(esa)],[c_24]) ).
cnf(c_10,plain,
b_holds(key(generate_key(an_a_nonce),a)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_f9f8f1.p',c_0_69_0) ).
cnf(c_62,plain,
b_holds(key(generate_key(an_a_nonce),a)),
inference(copy,[status(esa)],[c_10]) ).
cnf(c_80,plain,
~ a_holds(key(generate_key(an_a_nonce),b)),
inference(resolution,[status(thm)],[c_74,c_62]) ).
cnf(c_81,plain,
~ a_holds(key(generate_key(an_a_nonce),b)),
inference(rewriting,[status(thm)],[c_80]) ).
cnf(c_12,plain,
a_holds(key(generate_key(an_a_nonce),b)),
file('/export/starexec/sandbox2/tmp/iprover_modulo_f9f8f1.p',c_0_67_0) ).
cnf(c_66,plain,
a_holds(key(generate_key(an_a_nonce),b)),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_83,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_81,c_66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV011+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.13 % Command : iprover_modulo %s %d
% 0.12/0.34 % Computer : n024.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 : Wed Jun 15 07:25:33 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % Running in mono-core mode
% 0.20/0.40 % Orienting using strategy Equiv(ClausalAll)
% 0.20/0.40 % FOF problem with conjecture
% 0.20/0.40 % Executing iprover_moduloopt --modulo true --schedule none --sub_typing false --res_to_prop_solver none --res_prop_simpl_given false --res_lit_sel kbo_max --large_theory_mode false --res_time_limit 1000 --res_orphan_elimination false --prep_sem_filter none --prep_unflatten false --comb_res_mult 1000 --comb_inst_mult 300 --clausifier .//eprover --clausifier_options "--tstp-format " --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_ddc853.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_f9f8f1.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_31e1c0 | grep -v "SZS"
% 0.20/0.43
% 0.20/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ iProver source info
% 0.20/0.43
% 0.20/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.20/0.43 % git: non_committed_changes: true
% 0.20/0.43 % git: last_make_outside_of_git: true
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_ddc853.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43 % ------ Parsing...% successful
% 0.20/0.43
% 0.20/0.43 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e pe_s pe_e snvd_s sp: 0 0s snvd_e %
% 0.20/0.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 % ------ Problem Properties
% 0.20/0.43
% 0.20/0.43 %
% 0.20/0.43 % EPR false
% 0.20/0.43 % Horn true
% 0.20/0.43 % Has equality false
% 0.20/0.43
% 0.20/0.43 % % ------ Input Options Time Limit: Unbounded
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % % ------ Current options:
% 0.20/0.43
% 0.20/0.43 % ------ Input Options
% 0.20/0.43
% 0.20/0.43 % --out_options all
% 0.20/0.43 % --tptp_safe_out true
% 0.20/0.43 % --problem_path ""
% 0.20/0.43 % --include_path ""
% 0.20/0.43 % --clausifier .//eprover
% 0.20/0.43 % --clausifier_options --tstp-format
% 0.20/0.43 % --stdin false
% 0.20/0.43 % --dbg_backtrace false
% 0.20/0.43 % --dbg_dump_prop_clauses false
% 0.20/0.43 % --dbg_dump_prop_clauses_file -
% 0.20/0.43 % --dbg_out_stat false
% 0.20/0.43
% 0.20/0.43 % ------ General Options
% 0.20/0.43
% 0.20/0.43 % --fof false
% 0.20/0.43 % --time_out_real 150.
% 0.20/0.43 % --time_out_prep_mult 0.2
% 0.20/0.43 % --time_out_virtual -1.
% 0.20/0.43 % --schedule none
% 0.20/0.43 % --ground_splitting input
% 0.20/0.43 % --splitting_nvd 16
% 0.20/0.43 % --non_eq_to_eq false
% 0.20/0.43 % --prep_gs_sim true
% 0.20/0.43 % --prep_unflatten false
% 0.20/0.43 % --prep_res_sim true
% 0.20/0.43 % --prep_upred true
% 0.20/0.43 % --res_sim_input true
% 0.20/0.43 % --clause_weak_htbl true
% 0.20/0.43 % --gc_record_bc_elim false
% 0.20/0.43 % --symbol_type_check false
% 0.20/0.43 % --clausify_out false
% 0.20/0.43 % --large_theory_mode false
% 0.20/0.43 % --prep_sem_filter none
% 0.20/0.43 % --prep_sem_filter_out false
% 0.20/0.43 % --preprocessed_out false
% 0.20/0.43 % --sub_typing false
% 0.20/0.43 % --brand_transform false
% 0.20/0.43 % --pure_diseq_elim true
% 0.20/0.43 % --min_unsat_core false
% 0.20/0.43 % --pred_elim true
% 0.20/0.43 % --add_important_lit false
% 0.20/0.43 % --soft_assumptions false
% 0.20/0.43 % --reset_solvers false
% 0.20/0.43 % --bc_imp_inh []
% 0.20/0.43 % --conj_cone_tolerance 1.5
% 0.20/0.43 % --prolific_symb_bound 500
% 0.20/0.43 % --lt_threshold 2000
% 0.20/0.43
% 0.20/0.43 % ------ SAT Options
% 0.20/0.43
% 0.20/0.43 % --sat_mode false
% 0.20/0.43 % --sat_fm_restart_options ""
% 0.20/0.43 % --sat_gr_def false
% 0.20/0.43 % --sat_epr_types true
% 0.20/0.43 % --sat_non_cyclic_types false
% 0.20/0.43 % --sat_finite_models false
% 0.20/0.43 % --sat_fm_lemmas false
% 0.20/0.43 % --sat_fm_prep false
% 0.20/0.43 % --sat_fm_uc_incr true
% 0.20/0.43 % --sat_out_model small
% 0.20/0.43 % --sat_out_clauses false
% 0.20/0.43
% 0.20/0.43 % ------ QBF Options
% 0.20/0.43
% 0.20/0.43 % --qbf_mode false
% 0.20/0.43 % --qbf_elim_univ true
% 0.20/0.43 % --qbf_sk_in true
% 0.20/0.43 % --qbf_pred_elim true
% 0.20/0.43 % --qbf_split 32
% 0.20/0.43
% 0.20/0.43 % ------ BMC1 Options
% 0.20/0.43
% 0.20/0.43 % --bmc1_incremental false
% 0.20/0.43 % --bmc1_axioms reachable_all
% 0.20/0.43 % --bmc1_min_bound 0
% 0.20/0.43 % --bmc1_max_bound -1
% 0.20/0.43 % --bmc1_max_bound_default -1
% 0.20/0.43 % --bmc1_symbol_reachability true
% 0.20/0.43 % --bmc1_property_lemmas false
% 0.20/0.43 % --bmc1_k_induction false
% 0.20/0.43 % --bmc1_non_equiv_states false
% 0.20/0.43 % --bmc1_deadlock false
% 0.20/0.43 % --bmc1_ucm false
% 0.20/0.43 % --bmc1_add_unsat_core none
% 0.20/0.43 % --bmc1_unsat_core_children false
% 0.20/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.20/0.43 % --bmc1_out_stat full
% 0.20/0.43 % --bmc1_ground_init false
% 0.20/0.43 % --bmc1_pre_inst_next_state false
% 0.20/0.43 % --bmc1_pre_inst_state false
% 0.20/0.43 % --bmc1_pre_inst_reach_state false
% 0.20/0.43 % --bmc1_out_unsat_core false
% 0.20/0.43 % --bmc1_aig_witness_out false
% 0.20/0.43 % --bmc1_verbose false
% 0.20/0.43 % --bmc1_dump_clauses_tptp false
% 0.20/0.43 % --bmc1_dump_unsat_core_tptp false
% 0.20/0.43 % --bmc1_dump_file -
% 0.20/0.43 % --bmc1_ucm_expand_uc_limit 128
% 0.20/0.43 % --bmc1_ucm_n_expand_iterations 6
% 0.20/0.43 % --bmc1_ucm_extend_mode 1
% 0.20/0.43 % --bmc1_ucm_init_mode 2
% 0.20/0.43 % --bmc1_ucm_cone_mode none
% 0.20/0.43 % --bmc1_ucm_reduced_relation_type 0
% 0.20/0.43 % --bmc1_ucm_relax_model 4
% 0.20/0.43 % --bmc1_ucm_full_tr_after_sat true
% 0.20/0.43 % --bmc1_ucm_expand_neg_assumptions false
% 0.20/0.43 % --bmc1_ucm_layered_model none
% 0.20/0.43 % --bmc1_ucm_max_lemma_size 10
% 0.20/0.43
% 0.20/0.43 % ------ AIG Options
% 0.20/0.43
% 0.20/0.43 % --aig_mode false
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation Options
% 0.20/0.43
% 0.20/0.43 % --instantiation_flag true
% 0.20/0.43 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.20/0.43 % --inst_solver_per_active 750
% 0.20/0.43 % --inst_solver_calls_frac 0.5
% 0.20/0.43 % --inst_passive_queue_type priority_queues
% 0.20/0.43 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.20/0.43 % --inst_passive_queues_freq [25;2]
% 0.20/0.43 % --inst_dismatching true
% 0.20/0.43 % --inst_eager_unprocessed_to_passive true
% 0.20/0.43 % --inst_prop_sim_given true
% 0.20/0.43 % --inst_prop_sim_new false
% 0.20/0.43 % --inst_orphan_elimination true
% 0.20/0.43 % --inst_learning_loop_flag true
% 0.20/0.43 % --inst_learning_start 3000
% 0.20/0.43 % --inst_learning_factor 2
% 0.20/0.43 % --inst_start_prop_sim_after_learn 3
% 0.20/0.43 % --inst_sel_renew solver
% 0.20/0.43 % --inst_lit_activity_flag true
% 0.20/0.43 % --inst_out_proof true
% 0.20/0.43
% 0.20/0.43 % ------ Resolution Options
% 0.20/0.43
% 0.20/0.43 % --resolution_flag true
% 0.20/0.43 % --res_lit_sel kbo_max
% 0.20/0.43 % --res_to_prop_solver none
% 0.20/0.43 % --res_prop_simpl_new false
% 0.20/0.43 % --res_prop_simpl_given false
% 0.20/0.43 % --res_passive_queue_type priority_queues
% 0.20/0.43 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.20/0.43 % --res_passive_queues_freq [15;5]
% 0.20/0.43 % --res_forward_subs full
% 0.20/0.43 % --res_backward_subs full
% 0.20/0.43 % --res_forward_subs_resolution true
% 0.20/0.43 % --res_backward_subs_resolution true
% 0.20/0.43 % --res_orphan_elimination false
% 0.20/0.43 % --res_time_limit 1000.
% 0.20/0.43 % --res_out_proof true
% 0.20/0.43 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_ddc853.s
% 0.20/0.43 % --modulo true
% 0.20/0.43
% 0.20/0.43 % ------ Combination Options
% 0.20/0.43
% 0.20/0.43 % --comb_res_mult 1000
% 0.20/0.43 % --comb_inst_mult 300
% 0.20/0.43 % ------
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % ------ Proving...
% 0.20/0.43 %
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 % Resolution empty clause
% 0.20/0.43
% 0.20/0.43 % ------ Statistics
% 0.20/0.43
% 0.20/0.43 % ------ General
% 0.20/0.43
% 0.20/0.43 % num_of_input_clauses: 17
% 0.20/0.43 % num_of_input_neg_conjectures: 1
% 0.20/0.43 % num_of_splits: 0
% 0.20/0.43 % num_of_split_atoms: 0
% 0.20/0.43 % num_of_sem_filtered_clauses: 0
% 0.20/0.43 % num_of_subtypes: 0
% 0.20/0.43 % monotx_restored_types: 0
% 0.20/0.43 % sat_num_of_epr_types: 0
% 0.20/0.43 % sat_num_of_non_cyclic_types: 0
% 0.20/0.43 % sat_guarded_non_collapsed_types: 0
% 0.20/0.43 % is_epr: 0
% 0.20/0.43 % is_horn: 1
% 0.20/0.43 % has_eq: 0
% 0.20/0.43 % num_pure_diseq_elim: 0
% 0.20/0.43 % simp_replaced_by: 0
% 0.20/0.43 % res_preprocessed: 2
% 0.20/0.43 % prep_upred: 0
% 0.20/0.43 % prep_unflattend: 0
% 0.20/0.43 % pred_elim_cands: 0
% 0.20/0.43 % pred_elim: 0
% 0.20/0.43 % pred_elim_cl: 0
% 0.20/0.43 % pred_elim_cycles: 0
% 0.20/0.43 % forced_gc_time: 0
% 0.20/0.43 % gc_basic_clause_elim: 0
% 0.20/0.43 % parsing_time: 0.
% 0.20/0.43 % sem_filter_time: 0.
% 0.20/0.43 % pred_elim_time: 0.
% 0.20/0.43 % out_proof_time: 0.
% 0.20/0.43 % monotx_time: 0.
% 0.20/0.43 % subtype_inf_time: 0.
% 0.20/0.43 % unif_index_cands_time: 0.
% 0.20/0.43 % unif_index_add_time: 0.
% 0.20/0.43 % total_time: 0.02
% 0.20/0.43 % num_of_symbols: 48
% 0.20/0.43 % num_of_terms: 70
% 0.20/0.43
% 0.20/0.43 % ------ Propositional Solver
% 0.20/0.43
% 0.20/0.43 % prop_solver_calls: 1
% 0.20/0.43 % prop_fast_solver_calls: 6
% 0.20/0.43 % prop_num_of_clauses: 18
% 0.20/0.43 % prop_preprocess_simplified: 34
% 0.20/0.43 % prop_fo_subsumed: 0
% 0.20/0.43 % prop_solver_time: 0.
% 0.20/0.43 % prop_fast_solver_time: 0.
% 0.20/0.43 % prop_unsat_core_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ QBF
% 0.20/0.43
% 0.20/0.43 % qbf_q_res: 0
% 0.20/0.43 % qbf_num_tautologies: 0
% 0.20/0.43 % qbf_prep_cycles: 0
% 0.20/0.43
% 0.20/0.43 % ------ BMC1
% 0.20/0.43
% 0.20/0.43 % bmc1_current_bound: -1
% 0.20/0.43 % bmc1_last_solved_bound: -1
% 0.20/0.43 % bmc1_unsat_core_size: -1
% 0.20/0.43 % bmc1_unsat_core_parents_size: -1
% 0.20/0.43 % bmc1_merge_next_fun: 0
% 0.20/0.43 % bmc1_unsat_core_clauses_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Instantiation
% 0.20/0.43
% 0.20/0.43 % inst_num_of_clauses: 17
% 0.20/0.43 % inst_num_in_passive: 0
% 0.20/0.43 % inst_num_in_active: 0
% 0.20/0.43 % inst_num_in_unprocessed: 17
% 0.20/0.43 % inst_num_of_loops: 0
% 0.20/0.43 % inst_num_of_learning_restarts: 0
% 0.20/0.43 % inst_num_moves_active_passive: 0
% 0.20/0.43 % inst_lit_activity: 0
% 0.20/0.43 % inst_lit_activity_moves: 0
% 0.20/0.43 % inst_num_tautologies: 0
% 0.20/0.43 % inst_num_prop_implied: 0
% 0.20/0.43 % inst_num_existing_simplified: 0
% 0.20/0.43 % inst_num_eq_res_simplified: 0
% 0.20/0.43 % inst_num_child_elim: 0
% 0.20/0.43 % inst_num_of_dismatching_blockings: 0
% 0.20/0.43 % inst_num_of_non_proper_insts: 0
% 0.20/0.43 % inst_num_of_duplicates: 0
% 0.20/0.43 % inst_inst_num_from_inst_to_res: 0
% 0.20/0.43 % inst_dismatching_checking_time: 0.
% 0.20/0.43
% 0.20/0.43 % ------ Resolution
% 0.20/0.43
% 0.20/0.43 % res_num_of_clauses: 18
% 0.20/0.43 % res_num_in_passive: 0
% 0.20/0.43 % res_num_in_active: 17
% 0.20/0.43 % res_num_of_loops: 2
% 0.20/0.43 % res_forward_subset_subsumed: 0
% 0.20/0.43 % res_backward_subset_subsumed: 0
% 0.20/0.43 % res_forward_subsumed: 0
% 0.20/0.43 % res_backward_subsumed: 0
% 0.20/0.43 % res_forward_subsumption_resolution: 1
% 0.20/0.43 % res_backward_subsumption_resolution: 0
% 0.20/0.43 % res_clause_to_clause_subsumption: 1
% 0.20/0.43 % res_orphan_elimination: 0
% 0.20/0.43 % res_tautology_del: 0
% 0.20/0.43 % res_num_eq_res_simplified: 0
% 0.20/0.43 % res_num_sel_changes: 0
% 0.20/0.43 % res_moves_from_active_to_pass: 0
% 0.20/0.43
% 0.20/0.43 % Status Unsatisfiable
% 0.20/0.43 % SZS status Theorem
% 0.20/0.43 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------