TSTP Solution File: LCL097-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : LCL097-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n026.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 : Sun Jul 17 11:30:28 EDT 2022
% Result : Unsatisfiable 16.28s 16.49s
% Output : CNFRefutation 16.28s
% 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
cnf(lg_3,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),U),equivalent(equivalent(Y,Z),U)),V),V)),
input ).
fof(lg_3_0,plain,
! [U,V,X,Y,Z] :
( is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),U),equivalent(equivalent(Y,Z),U)),V),V))
| $false ),
inference(orientation,[status(thm)],[lg_3]) ).
cnf(lg_2,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(Y,Z)),U),U)),
input ).
fof(lg_2_0,plain,
! [U,X,Y,Z] :
( is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(Y,Z)),U),U))
| $false ),
inference(orientation,[status(thm)],[lg_2]) ).
fof(def_lhs_atom1,axiom,
! [Z,Y,X,U] :
( lhs_atom1(Z,Y,X,U)
<=> is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),equivalent(Y,Z)),U),U)) ),
inference(definition,[],]) ).
fof(to_be_clausified_0,plain,
! [U,X,Y,Z] :
( lhs_atom1(Z,Y,X,U)
| $false ),
inference(fold_definition,[status(thm)],[lg_2_0,def_lhs_atom1]) ).
fof(def_lhs_atom2,axiom,
! [Z,Y,X,V,U] :
( lhs_atom2(Z,Y,X,V,U)
<=> is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X,Y),equivalent(X,Z)),U),equivalent(equivalent(Y,Z),U)),V),V)) ),
inference(definition,[],]) ).
fof(to_be_clausified_1,plain,
! [U,V,X,Y,Z] :
( lhs_atom2(Z,Y,X,V,U)
| $false ),
inference(fold_definition,[status(thm)],[lg_3_0,def_lhs_atom2]) ).
% Start CNF derivation
fof(c_0_0,axiom,
! [X1,X2,X3,X5,X4] :
( lhs_atom2(X1,X2,X3,X5,X4)
| ~ $true ),
file('<stdin>',to_be_clausified_1) ).
fof(c_0_1,axiom,
! [X1,X2,X3,X4] :
( lhs_atom1(X1,X2,X3,X4)
| ~ $true ),
file('<stdin>',to_be_clausified_0) ).
fof(c_0_2,plain,
! [X1,X2,X3,X5,X4] : lhs_atom2(X1,X2,X3,X5,X4),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_3,plain,
! [X1,X2,X3,X4] : lhs_atom1(X1,X2,X3,X4),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_4,plain,
! [X6,X7,X8,X9,X10] : lhs_atom2(X6,X7,X8,X9,X10),
inference(variable_rename,[status(thm)],[c_0_2]) ).
fof(c_0_5,plain,
! [X5,X6,X7,X8] : lhs_atom1(X5,X6,X7,X8),
inference(variable_rename,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
lhs_atom2(X1,X2,X3,X4,X5),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
lhs_atom1(X1,X2,X3,X4),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
lhs_atom2(X1,X2,X3,X4,X5),
c_0_6,
[final] ).
cnf(c_0_9,plain,
lhs_atom1(X1,X2,X3,X4),
c_0_7,
[final] ).
% End CNF derivation
cnf(c_0_8_0,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X3,X2),equivalent(X3,X1)),X5),equivalent(equivalent(X2,X1),X5)),X4),X4)),
inference(unfold_definition,[status(thm)],[c_0_8,def_lhs_atom2]) ).
cnf(c_0_9_0,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X3,X2),equivalent(X3,X1)),equivalent(X2,X1)),X4),X4)),
inference(unfold_definition,[status(thm)],[c_0_9,def_lhs_atom1]) ).
% Orienting (remaining) axiom formulas using strategy ClausalAll
% CNF of (remaining) axioms:
% Start CNF derivation
fof(c_0_0_001,axiom,
! [X1,X2] :
( ~ is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(X2)
| is_a_theorem(X1) ),
file('<stdin>',condensed_detachment) ).
fof(c_0_1_002,plain,
! [X1,X2] :
( ~ is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(X2)
| is_a_theorem(X1) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_2_003,plain,
! [X3,X4] :
( ~ is_a_theorem(equivalent(X4,X3))
| ~ is_a_theorem(X4)
| is_a_theorem(X3) ),
inference(variable_rename,[status(thm)],[c_0_1]) ).
cnf(c_0_3_004,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_005,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X2,X1)) ),
c_0_3,
[final] ).
% End CNF derivation
% Generating one_way clauses for all literals in the CNF.
cnf(c_0_4_0,axiom,
( is_a_theorem(X1)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(literals_permutation,[status(thm)],[c_0_4]) ).
cnf(c_0_4_1,axiom,
( ~ is_a_theorem(X2)
| is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(literals_permutation,[status(thm)],[c_0_4]) ).
cnf(c_0_4_2,axiom,
( ~ is_a_theorem(equivalent(X2,X1))
| ~ is_a_theorem(X2)
| is_a_theorem(X1) ),
inference(literals_permutation,[status(thm)],[c_0_4]) ).
% CNF of non-axioms
% Start CNF derivation
fof(c_0_0_006,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
file('<stdin>',prove_lg_4) ).
fof(c_0_1_007,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_2_008,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
c_0_1 ).
cnf(c_0_3_009,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4_010,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
c_0_3,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_5,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
file('/export/starexec/sandbox/tmp/iprover_modulo_d7e960.p',c_0_4) ).
cnf(c_8,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_12,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
inference(copy,[status(esa)],[c_8]) ).
cnf(c_13,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
inference(copy,[status(esa)],[c_12]) ).
cnf(c_14,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
inference(copy,[status(esa)],[c_13]) ).
cnf(c_31,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_0,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
file('/export/starexec/sandbox/tmp/iprover_modulo_d7e960.p',c_0_4_0) ).
cnf(c_21,plain,
( ~ is_a_theorem(equivalent(X0,X1))
| ~ is_a_theorem(X0)
| is_a_theorem(X1) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_35,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_31,c_21]) ).
cnf(c_36,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))))
| ~ is_a_theorem(X0) ),
inference(rewriting,[status(thm)],[c_35]) ).
cnf(c_41,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e))))))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_36,c_21]) ).
cnf(c_42,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(X1,equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e))))))
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X0) ),
inference(rewriting,[status(thm)],[c_41]) ).
cnf(c_4,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4),X4)),
file('/export/starexec/sandbox/tmp/iprover_modulo_d7e960.p',c_0_8_0) ).
cnf(c_29,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4),X4)),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_57,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),equivalent(X4,equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e))))))
| ~ is_a_theorem(X4) ),
inference(resolution,[status(thm)],[c_42,c_29]) ).
cnf(c_58,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),equivalent(X4,equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e))))))
| ~ is_a_theorem(X4) ),
inference(rewriting,[status(thm)],[c_57]) ).
cnf(c_101,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),equivalent(X5,equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))))))
| ~ is_a_theorem(X5)
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_58,c_21]) ).
cnf(c_102,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),equivalent(X5,equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))))))
| ~ is_a_theorem(X5)
| ~ is_a_theorem(X0) ),
inference(rewriting,[status(thm)],[c_101]) ).
cnf(c_189,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),equivalent(equivalent(equivalent(equivalent(equivalent(X4,X5),equivalent(X4,X6)),X7),equivalent(equivalent(X5,X6),X7)),equivalent(X8,equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))))))
| ~ is_a_theorem(X8) ),
inference(resolution,[status(thm)],[c_102,c_29]) ).
cnf(c_190,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),equivalent(equivalent(equivalent(equivalent(equivalent(X4,X5),equivalent(X4,X6)),X7),equivalent(equivalent(X5,X6),X7)),equivalent(X8,equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))))))
| ~ is_a_theorem(X8) ),
inference(rewriting,[status(thm)],[c_189]) ).
cnf(c_3,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),X3),X3)),
file('/export/starexec/sandbox/tmp/iprover_modulo_d7e960.p',c_0_9_0) ).
cnf(c_27,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),X3),X3)),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_423,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(a,b),c)),equivalent(X0,e)),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
inference(resolution,[status(thm)],[c_190,c_27]) ).
cnf(c_424,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(a,b),c)),equivalent(X0,e)),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
inference(rewriting,[status(thm)],[c_423]) ).
cnf(c_449,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X1,equivalent(equivalent(a,b),c)),equivalent(X1,e)),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_424,c_21]) ).
cnf(c_450,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X1,equivalent(equivalent(a,b),c)),equivalent(X1,e)),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))))
| ~ is_a_theorem(X0) ),
inference(rewriting,[status(thm)],[c_449]) ).
cnf(c_965,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),equivalent(equivalent(equivalent(X4,equivalent(equivalent(a,b),c)),equivalent(X4,e)),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e))))),
inference(resolution,[status(thm)],[c_450,c_29]) ).
cnf(c_966,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),equivalent(equivalent(equivalent(X4,equivalent(equivalent(a,b),c)),equivalent(X4,e)),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e))))),
inference(rewriting,[status(thm)],[c_965]) ).
cnf(c_2331,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),equivalent(equivalent(equivalent(X5,equivalent(equivalent(a,b),c)),equivalent(X5,e)),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e))))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_966,c_21]) ).
cnf(c_2332,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),equivalent(equivalent(equivalent(X5,equivalent(equivalent(a,b),c)),equivalent(X5,e)),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e))))))
| ~ is_a_theorem(X0) ),
inference(rewriting,[status(thm)],[c_2331]) ).
cnf(c_5465,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),equivalent(equivalent(equivalent(equivalent(equivalent(X4,X5),equivalent(X4,X6)),X7),equivalent(equivalent(X5,X6),X7)),equivalent(equivalent(equivalent(X8,equivalent(equivalent(a,b),c)),equivalent(X8,e)),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))))),
inference(resolution,[status(thm)],[c_2332,c_29]) ).
cnf(c_5466,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),equivalent(equivalent(equivalent(equivalent(equivalent(X4,X5),equivalent(X4,X6)),X7),equivalent(equivalent(X5,X6),X7)),equivalent(equivalent(equivalent(X8,equivalent(equivalent(a,b),c)),equivalent(X8,e)),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))))),
inference(rewriting,[status(thm)],[c_5465]) ).
cnf(c_15345,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),equivalent(equivalent(equivalent(equivalent(equivalent(X5,X6),equivalent(X5,X7)),X8),equivalent(equivalent(X6,X7),X8)),equivalent(equivalent(equivalent(X9,equivalent(equivalent(a,b),c)),equivalent(X9,e)),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))))))
| ~ is_a_theorem(X0) ),
inference(resolution,[status(thm)],[c_5466,c_21]) ).
cnf(c_15346,plain,
( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),equivalent(equivalent(equivalent(equivalent(equivalent(X5,X6),equivalent(X5,X7)),X8),equivalent(equivalent(X6,X7),X8)),equivalent(equivalent(equivalent(X9,equivalent(equivalent(a,b),c)),equivalent(X9,e)),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))))))
| ~ is_a_theorem(X0) ),
inference(rewriting,[status(thm)],[c_15345]) ).
cnf(c_37508,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),equivalent(equivalent(equivalent(equivalent(equivalent(X4,X5),equivalent(X4,X6)),X7),equivalent(equivalent(X5,X6),X7)),equivalent(equivalent(equivalent(equivalent(equivalent(X8,X9),equivalent(X8,X10)),X11),equivalent(equivalent(X9,X10),X11)),equivalent(equivalent(equivalent(X12,equivalent(equivalent(a,b),c)),equivalent(X12,e)),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e))))))),
inference(resolution,[status(thm)],[c_15346,c_29]) ).
cnf(c_37509,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),equivalent(equivalent(equivalent(equivalent(equivalent(X4,X5),equivalent(X4,X6)),X7),equivalent(equivalent(X5,X6),X7)),equivalent(equivalent(equivalent(equivalent(equivalent(X8,X9),equivalent(X8,X10)),X11),equivalent(equivalent(X9,X10),X11)),equivalent(equivalent(equivalent(X12,equivalent(equivalent(a,b),c)),equivalent(X12,e)),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e))))))),
inference(rewriting,[status(thm)],[c_37508]) ).
cnf(c_128004,plain,
$false,
inference(resolution,[status(thm)],[c_37509,c_29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL097-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : iprover_modulo %s %d
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 4 06:33:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Running in mono-core mode
% 0.21/0.41 % Orienting using strategy Equiv(ClausalAll)
% 0.21/0.41 % Orientation found
% 0.21/0.41 % 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/sandbox/tmp/iprover_proof_077977.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox/tmp/iprover_modulo_d7e960.p | tee /export/starexec/sandbox/tmp/iprover_modulo_out_b08890 | grep -v "SZS"
% 0.21/0.43
% 0.21/0.43 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.21/0.43
% 0.21/0.43 %
% 0.21/0.43 % ------ iProver source info
% 0.21/0.43
% 0.21/0.43 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.21/0.43 % git: non_committed_changes: true
% 0.21/0.43 % git: last_make_outside_of_git: true
% 0.21/0.43
% 0.21/0.43 %
% 0.21/0.43 % ------ Input Options
% 0.21/0.43
% 0.21/0.43 % --out_options all
% 0.21/0.43 % --tptp_safe_out true
% 0.21/0.43 % --problem_path ""
% 0.21/0.43 % --include_path ""
% 0.21/0.43 % --clausifier .//eprover
% 0.21/0.43 % --clausifier_options --tstp-format
% 0.21/0.43 % --stdin false
% 0.21/0.43 % --dbg_backtrace false
% 0.21/0.43 % --dbg_dump_prop_clauses false
% 0.21/0.43 % --dbg_dump_prop_clauses_file -
% 0.21/0.43 % --dbg_out_stat false
% 0.21/0.43
% 0.21/0.43 % ------ General Options
% 0.21/0.43
% 0.21/0.43 % --fof false
% 0.21/0.43 % --time_out_real 150.
% 0.21/0.43 % --time_out_prep_mult 0.2
% 0.21/0.43 % --time_out_virtual -1.
% 0.21/0.43 % --schedule none
% 0.21/0.43 % --ground_splitting input
% 0.21/0.43 % --splitting_nvd 16
% 0.21/0.43 % --non_eq_to_eq false
% 0.21/0.43 % --prep_gs_sim true
% 0.21/0.43 % --prep_unflatten false
% 0.21/0.43 % --prep_res_sim true
% 0.21/0.43 % --prep_upred true
% 0.21/0.43 % --res_sim_input true
% 0.21/0.43 % --clause_weak_htbl true
% 0.21/0.43 % --gc_record_bc_elim false
% 0.21/0.43 % --symbol_type_check false
% 0.21/0.43 % --clausify_out false
% 0.21/0.43 % --large_theory_mode false
% 0.21/0.43 % --prep_sem_filter none
% 0.21/0.43 % --prep_sem_filter_out false
% 0.21/0.43 % --preprocessed_out false
% 0.21/0.43 % --sub_typing false
% 0.21/0.43 % --brand_transform false
% 0.21/0.43 % --pure_diseq_elim true
% 0.21/0.43 % --min_unsat_core false
% 0.21/0.43 % --pred_elim true
% 0.21/0.43 % --add_important_lit false
% 0.21/0.43 % --soft_assumptions false
% 0.21/0.43 % --reset_solvers false
% 0.21/0.43 % --bc_imp_inh []
% 0.21/0.43 % --conj_cone_tolerance 1.5
% 0.21/0.43 % --prolific_symb_bound 500
% 0.21/0.43 % --lt_threshold 2000
% 0.21/0.43
% 0.21/0.43 % ------ SAT Options
% 0.21/0.43
% 0.21/0.43 % --sat_mode false
% 0.21/0.43 % --sat_fm_restart_options ""
% 0.21/0.43 % --sat_gr_def false
% 0.21/0.43 % --sat_epr_types true
% 0.21/0.43 % --sat_non_cyclic_types false
% 0.21/0.43 % --sat_finite_models false
% 0.21/0.43 % --sat_fm_lemmas false
% 0.21/0.43 % --sat_fm_prep false
% 0.21/0.43 % --sat_fm_uc_incr true
% 0.21/0.43 % --sat_out_model small
% 0.21/0.43 % --sat_out_clauses false
% 0.21/0.43
% 0.21/0.43 % ------ QBF Options
% 0.21/0.43
% 0.21/0.43 % --qbf_mode false
% 0.21/0.43 % --qbf_elim_univ true
% 0.21/0.43 % --qbf_sk_in true
% 0.21/0.43 % --qbf_pred_elim true
% 0.21/0.43 % --qbf_split 32
% 0.21/0.43
% 0.21/0.43 % ------ BMC1 Options
% 0.21/0.43
% 0.21/0.43 % --bmc1_incremental false
% 0.21/0.43 % --bmc1_axioms reachable_all
% 0.21/0.43 % --bmc1_min_bound 0
% 0.21/0.43 % --bmc1_max_bound -1
% 0.21/0.43 % --bmc1_max_bound_default -1
% 0.21/0.43 % --bmc1_symbol_reachability true
% 0.21/0.43 % --bmc1_property_lemmas false
% 0.21/0.43 % --bmc1_k_induction false
% 0.21/0.43 % --bmc1_non_equiv_states false
% 0.21/0.43 % --bmc1_deadlock false
% 0.21/0.43 % --bmc1_ucm false
% 0.21/0.43 % --bmc1_add_unsat_core none
% 0.21/0.43 % --bmc1_unsat_core_children false
% 0.21/0.43 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.43 % --bmc1_out_stat full
% 0.21/0.43 % --bmc1_ground_init false
% 0.21/0.43 % --bmc1_pre_inst_next_state false
% 0.21/0.43 % --bmc1_pre_inst_state false
% 0.21/0.43 % --bmc1_pre_inst_reach_state false
% 0.21/0.43 % --bmc1_out_unsat_core false
% 0.21/0.43 % --bmc1_aig_witness_out false
% 0.21/0.43 % --bmc1_verbose false
% 0.21/0.43 % --bmc1_dump_clauses_tptp false
% 0.21/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.44 % --bmc1_dump_file -
% 0.21/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.44 % --bmc1_ucm_extend_mode 1
% 0.21/0.44 % --bmc1_ucm_init_mode 2
% 0.21/0.44 % --bmc1_ucm_cone_mode none
% 0.21/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.44 % --bmc1_ucm_relax_model 4
% 0.21/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.44 % --bmc1_ucm_layered_model none
% 0.21/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.44
% 0.21/0.44 % ------ AIG Options
% 0.21/0.44
% 0.21/0.44 % --aig_mode false
% 0.21/0.44
% 0.21/0.44 % ------ Instantiation Options
% 0.21/0.44
% 0.21/0.44 % --instantiation_flag true
% 0.21/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.44 % --inst_solver_per_active 750
% 0.21/0.44 % --inst_solver_calls_frac 0.5
% 0.21/0.44 % --inst_passive_queue_type priority_queues
% 0.21/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.44 % --inst_passive_queues_freq [25;2]
% 0.21/0.44 % --inst_dismatching true
% 0.21/0.44 % --inst_eager_unprocessed_to_passive true
% 0.21/0.44 % --inst_prop_sim_given true
% 0.21/0.44 % --inst_prop_sim_new false
% 0.21/0.44 % --inst_orphan_elimination true
% 0.21/0.44 % --inst_learning_loop_flag true
% 0.21/0.44 % --inst_learning_start 3000
% 0.21/0.44 % --inst_learning_factor 2
% 0.21/0.44 % --inst_start_prop_sim_after_learn 3
% 0.21/0.44 % --inst_sel_renew solver
% 0.21/0.44 % --inst_lit_activity_flag true
% 0.21/0.44 % --inst_out_proof true
% 0.21/0.44
% 0.21/0.44 % ------ Resolution Options
% 0.21/0.44
% 0.21/0.44 % --resolution_flag true
% 0.21/0.44 % --res_lit_sel kbo_max
% 0.21/0.44 % --res_to_prop_solver none
% 0.21/0.44 % --res_prop_simpl_new false
% 0.21/0.44 % --res_prop_simpl_given false
% 0.21/0.44 % --res_passive_queue_type priority_queues
% 0.21/0.44 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.21/0.44 % --res_passive_queues_freq [15;5]
% 0.21/0.44 % --res_forward_subs full
% 0.21/0.44 % --res_backward_subs full
% 0.21/0.44 % --res_forward_subs_resolution true
% 0.21/0.44 % --res_backward_subs_resolution true
% 0.21/0.44 % --res_orphan_elimination false
% 0.21/0.44 % --res_time_limit 1000.
% 0.21/0.44 % --res_out_proof true
% 0.21/0.44 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_077977.s
% 0.21/0.44 % --modulo true
% 0.21/0.44
% 0.21/0.44 % ------ Combination Options
% 0.21/0.44
% 0.21/0.44 % --comb_res_mult 1000
% 0.21/0.44 % --comb_inst_mult 300
% 0.21/0.44 % ------
% 0.21/0.44
% 0.21/0.44 % ------ Parsing...% successful
% 0.21/0.44
% 0.21/0.44 % ------ 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.21/0.44
% 0.21/0.44 % ------ Proving...
% 0.21/0.44 % ------ Problem Properties
% 0.21/0.44
% 0.21/0.44 %
% 0.21/0.44 % EPR false
% 0.21/0.44 % Horn true
% 0.21/0.44 % Has equality false
% 0.21/0.44
% 0.21/0.44 % % ------ Input Options Time Limit: Unbounded
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 % % ------ Current options:
% 0.21/0.44
% 0.21/0.44 % ------ Input Options
% 0.21/0.44
% 0.21/0.44 % --out_options all
% 0.21/0.44 % --tptp_safe_out true
% 0.21/0.44 % --problem_path ""
% 0.21/0.44 % --include_path ""
% 0.21/0.44 % --clausifier .//eprover
% 0.21/0.44 % --clausifier_options --tstp-format
% 0.21/0.44 % --stdin false
% 0.21/0.44 % --dbg_backtrace false
% 0.21/0.44 % --dbg_dump_prop_clauses false
% 0.21/0.44 % --dbg_dump_prop_clauses_file -
% 0.21/0.44 % --dbg_out_stat false
% 0.21/0.44
% 0.21/0.44 % ------ General Options
% 0.21/0.44
% 0.21/0.44 % --fof false
% 0.21/0.44 % --time_out_real 150.
% 0.21/0.44 % --time_out_prep_mult 0.2
% 0.21/0.44 % --time_out_virtual -1.
% 0.21/0.44 % --schedule none
% 0.21/0.44 % --ground_splitting input
% 0.21/0.44 % --splitting_nvd 16
% 0.21/0.44 % --non_eq_to_eq false
% 0.21/0.44 % --prep_gs_sim true
% 0.21/0.44 % --prep_unflatten false
% 0.21/0.44 % --prep_res_sim true
% 0.21/0.44 % --prep_upred true
% 0.21/0.44 % --res_sim_input true
% 0.21/0.44 % --clause_weak_htbl true
% 0.21/0.44 % --gc_record_bc_elim false
% 0.21/0.44 % --symbol_type_check false
% 0.21/0.44 % --clausify_out false
% 0.21/0.44 % --large_theory_mode false
% 0.21/0.44 % --prep_sem_filter none
% 0.21/0.44 % --prep_sem_filter_out false
% 0.21/0.44 % --preprocessed_out false
% 0.21/0.44 % --sub_typing false
% 0.21/0.44 % --brand_transform false
% 0.21/0.44 % --pure_diseq_elim true
% 0.21/0.44 % --min_unsat_core false
% 0.21/0.44 % --pred_elim true
% 0.21/0.44 % --add_important_lit false
% 0.21/0.44 % --soft_assumptions false
% 0.21/0.44 % --reset_solvers false
% 0.21/0.44 % --bc_imp_inh []
% 0.21/0.44 % --conj_cone_tolerance 1.5
% 0.21/0.44 % --prolific_symb_bound 500
% 0.21/0.44 % --lt_threshold 2000
% 0.21/0.44
% 0.21/0.44 % ------ SAT Options
% 0.21/0.44
% 0.21/0.44 % --sat_mode false
% 0.21/0.44 % --sat_fm_restart_options ""
% 0.21/0.44 % --sat_gr_def false
% 0.21/0.44 % --sat_epr_types true
% 0.21/0.44 % --sat_non_cyclic_types false
% 0.21/0.44 % --sat_finite_models false
% 0.21/0.44 % --sat_fm_lemmas false
% 0.21/0.44 % --sat_fm_prep false
% 0.21/0.44 % --sat_fm_uc_incr true
% 0.21/0.44 % --sat_out_model small
% 0.21/0.44 % --sat_out_clauses false
% 0.21/0.44
% 0.21/0.44 % ------ QBF Options
% 0.21/0.44
% 0.21/0.44 % --qbf_mode false
% 0.21/0.44 % --qbf_elim_univ true
% 0.21/0.44 % --qbf_sk_in true
% 0.21/0.44 % --qbf_pred_elim true
% 0.21/0.44 % --qbf_split 32
% 0.21/0.44
% 0.21/0.44 % ------ BMC1 Options
% 0.21/0.44
% 0.21/0.44 % --bmc1_incremental false
% 0.21/0.44 % --bmc1_axioms reachable_all
% 0.21/0.44 % --bmc1_min_bound 0
% 0.21/0.44 % --bmc1_max_bound -1
% 0.21/0.44 % --bmc1_max_bound_default -1
% 0.21/0.44 % --bmc1_symbol_reachability true
% 0.21/0.44 % --bmc1_property_lemmas false
% 0.21/0.44 % --bmc1_k_induction false
% 0.21/0.44 % --bmc1_non_equiv_states false
% 0.21/0.44 % --bmc1_deadlock false
% 0.21/0.44 % --bmc1_ucm false
% 0.21/0.44 % --bmc1_add_unsat_core none
% 0.21/0.44 % --bmc1_unsat_core_children false
% 0.21/0.44 % --bmc1_unsat_core_extrapolate_axioms false
% 0.21/0.44 % --bmc1_out_stat full
% 0.21/0.44 % --bmc1_ground_init false
% 0.21/0.44 % --bmc1_pre_inst_next_state false
% 0.21/0.44 % --bmc1_pre_inst_state false
% 0.21/0.44 % --bmc1_pre_inst_reach_state false
% 0.21/0.44 % --bmc1_out_unsat_core false
% 0.21/0.44 % --bmc1_aig_witness_out false
% 0.21/0.44 % --bmc1_verbose false
% 0.21/0.44 % --bmc1_dump_clauses_tptp false
% 0.21/0.44 % --bmc1_dump_unsat_core_tptp false
% 0.21/0.44 % --bmc1_dump_file -
% 0.21/0.44 % --bmc1_ucm_expand_uc_limit 128
% 0.21/0.44 % --bmc1_ucm_n_expand_iterations 6
% 0.21/0.44 % --bmc1_ucm_extend_mode 1
% 0.21/0.44 % --bmc1_ucm_init_mode 2
% 0.21/0.44 % --bmc1_ucm_cone_mode none
% 0.21/0.44 % --bmc1_ucm_reduced_relation_type 0
% 0.21/0.44 % --bmc1_ucm_relax_model 4
% 0.21/0.44 % --bmc1_ucm_full_tr_after_sat true
% 0.21/0.44 % --bmc1_ucm_expand_neg_assumptions false
% 0.21/0.44 % --bmc1_ucm_layered_model none
% 0.21/0.44 % --bmc1_ucm_max_lemma_size 10
% 0.21/0.44
% 0.21/0.44 % ------ AIG Options
% 0.21/0.44
% 0.21/0.44 % --aig_mode false
% 0.21/0.44
% 0.21/0.44 % ------ Instantiation Options
% 0.21/0.44
% 0.21/0.44 % --instantiation_flag true
% 0.21/0.44 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.21/0.44 % --inst_solver_per_active 750
% 0.21/0.44 % --inst_solver_calls_frac 0.5
% 0.21/0.44 % --inst_passive_queue_type priority_queues
% 0.21/0.44 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.21/0.44 % --inst_passive_queues_freq [25;2]
% 0.21/0.44 % --inst_dismatching true
% 0.21/0.44 % --inst_eager_unprocessed_to_passive true
% 0.21/0.44 % --inst_prop_sim_given true
% 16.28/16.49 % --inst_prop_sim_new false
% 16.28/16.49 % --inst_orphan_elimination true
% 16.28/16.49 % --inst_learning_loop_flag true
% 16.28/16.49 % --inst_learning_start 3000
% 16.28/16.49 % --inst_learning_factor 2
% 16.28/16.49 % --inst_start_prop_sim_after_learn 3
% 16.28/16.49 % --inst_sel_renew solver
% 16.28/16.49 % --inst_lit_activity_flag true
% 16.28/16.49 % --inst_out_proof true
% 16.28/16.49
% 16.28/16.49 % ------ Resolution Options
% 16.28/16.49
% 16.28/16.49 % --resolution_flag true
% 16.28/16.49 % --res_lit_sel kbo_max
% 16.28/16.49 % --res_to_prop_solver none
% 16.28/16.49 % --res_prop_simpl_new false
% 16.28/16.49 % --res_prop_simpl_given false
% 16.28/16.49 % --res_passive_queue_type priority_queues
% 16.28/16.49 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 16.28/16.49 % --res_passive_queues_freq [15;5]
% 16.28/16.49 % --res_forward_subs full
% 16.28/16.49 % --res_backward_subs full
% 16.28/16.49 % --res_forward_subs_resolution true
% 16.28/16.49 % --res_backward_subs_resolution true
% 16.28/16.49 % --res_orphan_elimination false
% 16.28/16.49 % --res_time_limit 1000.
% 16.28/16.49 % --res_out_proof true
% 16.28/16.49 % --proof_out_file /export/starexec/sandbox/tmp/iprover_proof_077977.s
% 16.28/16.49 % --modulo true
% 16.28/16.49
% 16.28/16.49 % ------ Combination Options
% 16.28/16.49
% 16.28/16.49 % --comb_res_mult 1000
% 16.28/16.49 % --comb_inst_mult 300
% 16.28/16.49 % ------
% 16.28/16.49
% 16.28/16.49
% 16.28/16.49
% 16.28/16.49 % ------ Proving...
% 16.28/16.49 %
% 16.28/16.49
% 16.28/16.49
% 16.28/16.49 % Resolution empty clause
% 16.28/16.49
% 16.28/16.49 % ------ Statistics
% 16.28/16.49
% 16.28/16.49 % ------ General
% 16.28/16.49
% 16.28/16.49 % num_of_input_clauses: 6
% 16.28/16.49 % num_of_input_neg_conjectures: 1
% 16.28/16.49 % num_of_splits: 0
% 16.28/16.49 % num_of_split_atoms: 0
% 16.28/16.49 % num_of_sem_filtered_clauses: 0
% 16.28/16.49 % num_of_subtypes: 0
% 16.28/16.49 % monotx_restored_types: 0
% 16.28/16.49 % sat_num_of_epr_types: 0
% 16.28/16.49 % sat_num_of_non_cyclic_types: 0
% 16.28/16.49 % sat_guarded_non_collapsed_types: 0
% 16.28/16.49 % is_epr: 0
% 16.28/16.49 % is_horn: 1
% 16.28/16.49 % has_eq: 0
% 16.28/16.49 % num_pure_diseq_elim: 0
% 16.28/16.49 % simp_replaced_by: 0
% 16.28/16.49 % res_preprocessed: 2
% 16.28/16.49 % prep_upred: 0
% 16.28/16.49 % prep_unflattend: 0
% 16.28/16.49 % pred_elim_cands: 0
% 16.28/16.49 % pred_elim: 0
% 16.28/16.49 % pred_elim_cl: 0
% 16.28/16.49 % pred_elim_cycles: 0
% 16.28/16.49 % forced_gc_time: 0
% 16.28/16.49 % gc_basic_clause_elim: 0
% 16.28/16.49 % parsing_time: 0.
% 16.28/16.49 % sem_filter_time: 0.
% 16.28/16.49 % pred_elim_time: 0.
% 16.28/16.49 % out_proof_time: 0.001
% 16.28/16.49 % monotx_time: 0.
% 16.28/16.49 % subtype_inf_time: 0.
% 16.28/16.49 % unif_index_cands_time: 0.513
% 16.28/16.49 % unif_index_add_time: 0.038
% 16.28/16.49 % total_time: 16.076
% 16.28/16.49 % num_of_symbols: 32
% 16.28/16.49 % num_of_terms: 226590
% 16.28/16.49
% 16.28/16.49 % ------ Propositional Solver
% 16.28/16.49
% 16.28/16.49 % prop_solver_calls: 18
% 16.28/16.49 % prop_fast_solver_calls: 3
% 16.28/16.49 % prop_num_of_clauses: 8505
% 16.28/16.49 % prop_preprocess_simplified: 9464
% 16.28/16.49 % prop_fo_subsumed: 0
% 16.28/16.49 % prop_solver_time: 0.003
% 16.28/16.49 % prop_fast_solver_time: 0.
% 16.28/16.49 % prop_unsat_core_time: 0.
% 16.28/16.49
% 16.28/16.49 % ------ QBF
% 16.28/16.49
% 16.28/16.49 % qbf_q_res: 0
% 16.28/16.49 % qbf_num_tautologies: 0
% 16.28/16.49 % qbf_prep_cycles: 0
% 16.28/16.49
% 16.28/16.49 % ------ BMC1
% 16.28/16.49
% 16.28/16.49 % bmc1_current_bound: -1
% 16.28/16.49 % bmc1_last_solved_bound: -1
% 16.28/16.49 % bmc1_unsat_core_size: -1
% 16.28/16.49 % bmc1_unsat_core_parents_size: -1
% 16.28/16.49 % bmc1_merge_next_fun: 0
% 16.28/16.49 % bmc1_unsat_core_clauses_time: 0.
% 16.28/16.49
% 16.28/16.49 % ------ Instantiation
% 16.28/16.49
% 16.28/16.49 % inst_num_of_clauses: 4683
% 16.28/16.49 % inst_num_in_passive: 2660
% 16.28/16.49 % inst_num_in_active: 1617
% 16.28/16.49 % inst_num_in_unprocessed: 390
% 16.28/16.49 % inst_num_of_loops: 1800
% 16.28/16.49 % inst_num_of_learning_restarts: 0
% 16.28/16.49 % inst_num_moves_active_passive: 160
% 16.28/16.49 % inst_lit_activity: 196
% 16.28/16.49 % inst_lit_activity_moves: 0
% 16.28/16.49 % inst_num_tautologies: 16
% 16.28/16.49 % inst_num_prop_implied: 0
% 16.28/16.49 % inst_num_existing_simplified: 0
% 16.28/16.49 % inst_num_eq_res_simplified: 0
% 16.28/16.49 % inst_num_child_elim: 0
% 16.28/16.49 % inst_num_of_dismatching_blockings: 21981
% 16.28/16.49 % inst_num_of_non_proper_insts: 14638
% 16.28/16.49 % inst_num_of_duplicates: 10346
% 16.28/16.49 % inst_inst_num_from_inst_to_res: 0
% 16.28/16.49 % inst_dismatching_checking_time: 0.101
% 16.28/16.49
% 16.28/16.49 % ------ Resolution
% 16.28/16.49
% 16.28/16.49 % res_num_of_clauses: 14324
% 16.28/16.49 % res_num_in_passive: 7734
% 16.28/16.49 % res_num_in_active: 6588
% 16.28/16.49 % res_num_of_loops: 6600
% 16.28/16.49 % res_forward_subset_subsumed: 1514
% 16.28/16.49 % res_backward_subset_subsumed: 0
% 16.28/16.49 % res_forward_subsumed: 15
% 16.28/16.49 % res_backward_subsumed: 0
% 16.28/16.49 % res_forward_subsumption_resolution: 0
% 16.28/16.49 % res_backward_subsumption_resolution: 0
% 16.28/16.49 % res_clause_to_clause_subsumption: 143760
% 16.28/16.49 % res_orphan_elimination: 0
% 16.28/16.49 % res_tautology_del: 0
% 16.28/16.49 % res_num_eq_res_simplified: 0
% 16.28/16.49 % res_num_sel_changes: 0
% 16.28/16.49 % res_moves_from_active_to_pass: 0
% 16.28/16.49
% 16.28/16.49 % Status Unsatisfiable
% 16.28/16.49 % SZS status Unsatisfiable
% 16.28/16.49 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------