TSTP Solution File: SYN012-1 by iProverMo---2.5-0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProverMo---2.5-0.1
% Problem : SYN012-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : iprover_modulo %s %d
% Computer : n027.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 : Thu Jul 21 07:22:19 EDT 2022
% Result : Unsatisfiable 0.17s 0.41s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 14
% Syntax : Number of formulae : 96 ( 5 unt; 0 def)
% Number of atoms : 222 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 243 ( 117 ~; 126 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 182 ( 4 sgn 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
% Axioms transformation by autotheo
% Orienting (remaining) axiom formulas using strategy Equiv(ClausalAll)
% Orienting axioms whose shape is orientable
% Start CNF derivation
% End CNF derivation
% 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,negated_conjecture,
! [X1,X2] :
( ~ big_f(X2,X1)
| ~ big_f(g(X2,X1),g(X2,X1))
| big_g(g(X2,X1),g(X2,X1)) ),
file('<stdin>',clause_3) ).
fof(c_0_1,negated_conjecture,
! [X1,X2] :
( ~ big_g(X2,X1)
| ~ big_g(g(X2,X1),g(X2,X1)) ),
file('<stdin>',clause_7) ).
fof(c_0_2,negated_conjecture,
! [X1,X2] :
( ~ big_f(X2,X1)
| big_f(X2,g(X2,X1))
| ~ big_g(X1,g(X2,X1)) ),
file('<stdin>',clause_2) ).
fof(c_0_3,negated_conjecture,
! [X1,X2] :
( ~ big_f(X2,X1)
| ~ big_f(X2,g(X2,X1))
| big_g(X1,g(X2,X1)) ),
file('<stdin>',clause_1) ).
fof(c_0_4,negated_conjecture,
! [X1,X2] :
( big_f(X2,X1)
| ~ big_g(g(X2,X1),g(X2,X1)) ),
file('<stdin>',clause_5) ).
fof(c_0_5,negated_conjecture,
! [X1,X2] :
( big_g(X2,X1)
| big_g(g(X2,X1),g(X2,X1)) ),
file('<stdin>',clause_6) ).
fof(c_0_6,negated_conjecture,
! [X1,X2] :
( big_f(X2,X1)
| big_f(g(X2,X1),g(X2,X1)) ),
file('<stdin>',clause_4) ).
fof(c_0_7,negated_conjecture,
! [X1,X2] :
( ~ big_f(X2,X1)
| ~ big_f(g(X2,X1),g(X2,X1))
| big_g(g(X2,X1),g(X2,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_0]) ).
fof(c_0_8,negated_conjecture,
! [X1,X2] :
( ~ big_g(X2,X1)
| ~ big_g(g(X2,X1),g(X2,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_1]) ).
fof(c_0_9,negated_conjecture,
! [X1,X2] :
( ~ big_f(X2,X1)
| big_f(X2,g(X2,X1))
| ~ big_g(X1,g(X2,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_10,negated_conjecture,
! [X1,X2] :
( ~ big_f(X2,X1)
| ~ big_f(X2,g(X2,X1))
| big_g(X1,g(X2,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_3]) ).
fof(c_0_11,negated_conjecture,
! [X1,X2] :
( big_f(X2,X1)
| ~ big_g(g(X2,X1),g(X2,X1)) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_12,negated_conjecture,
! [X1,X2] :
( big_g(X2,X1)
| big_g(g(X2,X1),g(X2,X1)) ),
c_0_5 ).
fof(c_0_13,negated_conjecture,
! [X1,X2] :
( big_f(X2,X1)
| big_f(g(X2,X1),g(X2,X1)) ),
c_0_6 ).
fof(c_0_14,negated_conjecture,
! [X3,X4] :
( ~ big_f(X4,X3)
| ~ big_f(g(X4,X3),g(X4,X3))
| big_g(g(X4,X3),g(X4,X3)) ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_15,negated_conjecture,
! [X3,X4] :
( ~ big_g(X4,X3)
| ~ big_g(g(X4,X3),g(X4,X3)) ),
inference(variable_rename,[status(thm)],[c_0_8]) ).
fof(c_0_16,negated_conjecture,
! [X3,X4] :
( ~ big_f(X4,X3)
| big_f(X4,g(X4,X3))
| ~ big_g(X3,g(X4,X3)) ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_17,negated_conjecture,
! [X3,X4] :
( ~ big_f(X4,X3)
| ~ big_f(X4,g(X4,X3))
| big_g(X3,g(X4,X3)) ),
inference(variable_rename,[status(thm)],[c_0_10]) ).
fof(c_0_18,negated_conjecture,
! [X3,X4] :
( big_f(X4,X3)
| ~ big_g(g(X4,X3),g(X4,X3)) ),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_19,negated_conjecture,
! [X3,X4] :
( big_g(X4,X3)
| big_g(g(X4,X3),g(X4,X3)) ),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_20,negated_conjecture,
! [X3,X4] :
( big_f(X4,X3)
| big_f(g(X4,X3),g(X4,X3)) ),
inference(variable_rename,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
( big_g(g(X1,X2),g(X1,X2))
| ~ big_f(g(X1,X2),g(X1,X2))
| ~ big_f(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
( ~ big_g(g(X1,X2),g(X1,X2))
| ~ big_g(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
( big_f(X2,g(X2,X1))
| ~ big_g(X1,g(X2,X1))
| ~ big_f(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,negated_conjecture,
( big_g(X1,g(X2,X1))
| ~ big_f(X2,g(X2,X1))
| ~ big_f(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
( big_f(X1,X2)
| ~ big_g(g(X1,X2),g(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,negated_conjecture,
( big_g(g(X1,X2),g(X1,X2))
| big_g(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,negated_conjecture,
( big_f(g(X1,X2),g(X1,X2))
| big_f(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
( big_g(g(X1,X2),g(X1,X2))
| ~ big_f(g(X1,X2),g(X1,X2))
| ~ big_f(X1,X2) ),
c_0_21,
[final] ).
cnf(c_0_29,negated_conjecture,
( ~ big_g(g(X1,X2),g(X1,X2))
| ~ big_g(X1,X2) ),
c_0_22,
[final] ).
cnf(c_0_30,negated_conjecture,
( big_f(X2,g(X2,X1))
| ~ big_g(X1,g(X2,X1))
| ~ big_f(X2,X1) ),
c_0_23,
[final] ).
cnf(c_0_31,negated_conjecture,
( big_g(X1,g(X2,X1))
| ~ big_f(X2,g(X2,X1))
| ~ big_f(X2,X1) ),
c_0_24,
[final] ).
cnf(c_0_32,negated_conjecture,
( big_f(X1,X2)
| ~ big_g(g(X1,X2),g(X1,X2)) ),
c_0_25,
[final] ).
cnf(c_0_33,negated_conjecture,
( big_g(g(X1,X2),g(X1,X2))
| big_g(X1,X2) ),
c_0_26,
[final] ).
cnf(c_0_34,negated_conjecture,
( big_f(g(X1,X2),g(X1,X2))
| big_f(X1,X2) ),
c_0_27,
[final] ).
% End CNF derivation
%-------------------------------------------------------------
% Proof by iprover
cnf(c_4,negated_conjecture,
( ~ big_g(g(X0,X1),g(X0,X1))
| big_f(X0,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_9ace24.p',c_0_32) ).
cnf(c_22,negated_conjecture,
( ~ big_g(g(X0,X1),g(X0,X1))
| big_f(X0,X1) ),
inference(copy,[status(esa)],[c_4]) ).
cnf(c_46,negated_conjecture,
( ~ big_g(g(X0,X1),g(X0,X1))
| big_f(X0,X1) ),
inference(copy,[status(esa)],[c_22]) ).
cnf(c_51,negated_conjecture,
( ~ big_g(g(X0,X1),g(X0,X1))
| big_f(X0,X1) ),
inference(copy,[status(esa)],[c_46]) ).
cnf(c_60,negated_conjecture,
( ~ big_g(g(X0,X1),g(X0,X1))
| big_f(X0,X1) ),
inference(copy,[status(esa)],[c_51]) ).
cnf(c_78,negated_conjecture,
( ~ big_g(g(X0,X1),g(X0,X1))
| big_f(X0,X1) ),
inference(copy,[status(esa)],[c_60]) ).
cnf(c_5,negated_conjecture,
( big_g(g(X0,X1),g(X0,X1))
| big_g(X0,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_9ace24.p',c_0_33) ).
cnf(c_24,negated_conjecture,
( big_g(g(X0,X1),g(X0,X1))
| big_g(X0,X1) ),
inference(copy,[status(esa)],[c_5]) ).
cnf(c_47,negated_conjecture,
( big_g(g(X0,X1),g(X0,X1))
| big_g(X0,X1) ),
inference(copy,[status(esa)],[c_24]) ).
cnf(c_50,negated_conjecture,
( big_g(g(X0,X1),g(X0,X1))
| big_g(X0,X1) ),
inference(copy,[status(esa)],[c_47]) ).
cnf(c_61,negated_conjecture,
( big_g(g(X0,X1),g(X0,X1))
| big_g(X0,X1) ),
inference(copy,[status(esa)],[c_50]) ).
cnf(c_80,negated_conjecture,
( big_g(g(X0,X1),g(X0,X1))
| big_g(X0,X1) ),
inference(copy,[status(esa)],[c_61]) ).
cnf(c_96,plain,
( big_g(X0,X1)
| big_f(X0,X1) ),
inference(resolution,[status(thm)],[c_78,c_80]) ).
cnf(c_97,plain,
( big_g(X0,X1)
| big_f(X0,X1) ),
inference(rewriting,[status(thm)],[c_96]) ).
cnf(c_3,negated_conjecture,
( big_g(X0,g(X1,X0))
| ~ big_f(X1,g(X1,X0))
| ~ big_f(X1,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_9ace24.p',c_0_31) ).
cnf(c_20,negated_conjecture,
( big_g(X0,g(X1,X0))
| ~ big_f(X1,g(X1,X0))
| ~ big_f(X1,X0) ),
inference(copy,[status(esa)],[c_3]) ).
cnf(c_45,negated_conjecture,
( big_g(X0,g(X1,X0))
| ~ big_f(X1,g(X1,X0))
| ~ big_f(X1,X0) ),
inference(copy,[status(esa)],[c_20]) ).
cnf(c_52,negated_conjecture,
( big_g(X0,g(X1,X0))
| ~ big_f(X1,g(X1,X0))
| ~ big_f(X1,X0) ),
inference(copy,[status(esa)],[c_45]) ).
cnf(c_59,negated_conjecture,
( big_g(X0,g(X1,X0))
| ~ big_f(X1,g(X1,X0))
| ~ big_f(X1,X0) ),
inference(copy,[status(esa)],[c_52]) ).
cnf(c_76,negated_conjecture,
( big_g(X0,g(X1,X0))
| ~ big_f(X1,g(X1,X0))
| ~ big_f(X1,X0) ),
inference(copy,[status(esa)],[c_59]) ).
cnf(c_130,plain,
( big_g(X0,g(X0,X1))
| big_g(X1,g(X0,X1))
| ~ big_f(X0,X1) ),
inference(resolution,[status(thm)],[c_97,c_76]) ).
cnf(c_131,plain,
( big_g(X0,g(X0,X1))
| big_g(X1,g(X0,X1))
| ~ big_f(X0,X1) ),
inference(rewriting,[status(thm)],[c_130]) ).
cnf(c_154,plain,
( big_g(X0,g(X0,X0))
| ~ big_f(X0,X0) ),
inference(factoring,[status(thm)],[c_131]) ).
cnf(c_155,plain,
( big_g(X0,g(X0,X0))
| ~ big_f(X0,X0) ),
inference(rewriting,[status(thm)],[c_154]) ).
cnf(c_2,negated_conjecture,
( ~ big_g(X0,g(X1,X0))
| big_f(X1,g(X1,X0))
| ~ big_f(X1,X0) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_9ace24.p',c_0_30) ).
cnf(c_18,negated_conjecture,
( ~ big_g(X0,g(X1,X0))
| big_f(X1,g(X1,X0))
| ~ big_f(X1,X0) ),
inference(copy,[status(esa)],[c_2]) ).
cnf(c_44,negated_conjecture,
( ~ big_g(X0,g(X1,X0))
| big_f(X1,g(X1,X0))
| ~ big_f(X1,X0) ),
inference(copy,[status(esa)],[c_18]) ).
cnf(c_53,negated_conjecture,
( ~ big_g(X0,g(X1,X0))
| big_f(X1,g(X1,X0))
| ~ big_f(X1,X0) ),
inference(copy,[status(esa)],[c_44]) ).
cnf(c_58,negated_conjecture,
( ~ big_g(X0,g(X1,X0))
| big_f(X1,g(X1,X0))
| ~ big_f(X1,X0) ),
inference(copy,[status(esa)],[c_53]) ).
cnf(c_74,negated_conjecture,
( ~ big_g(X0,g(X1,X0))
| big_f(X1,g(X1,X0))
| ~ big_f(X1,X0) ),
inference(copy,[status(esa)],[c_58]) ).
cnf(c_164,plain,
( big_f(X0,g(X0,X0))
| ~ big_f(X0,X0) ),
inference(resolution,[status(thm)],[c_155,c_74]) ).
cnf(c_165,plain,
( big_f(X0,g(X0,X0))
| ~ big_f(X0,X0) ),
inference(rewriting,[status(thm)],[c_164]) ).
cnf(c_0,negated_conjecture,
( big_g(g(X0,X1),g(X0,X1))
| ~ big_f(g(X0,X1),g(X0,X1))
| ~ big_f(X0,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_9ace24.p',c_0_28) ).
cnf(c_14,negated_conjecture,
( big_g(g(X0,X1),g(X0,X1))
| ~ big_f(g(X0,X1),g(X0,X1))
| ~ big_f(X0,X1) ),
inference(copy,[status(esa)],[c_0]) ).
cnf(c_42,negated_conjecture,
( big_g(g(X0,X1),g(X0,X1))
| ~ big_f(g(X0,X1),g(X0,X1))
| ~ big_f(X0,X1) ),
inference(copy,[status(esa)],[c_14]) ).
cnf(c_55,negated_conjecture,
( big_g(g(X0,X1),g(X0,X1))
| ~ big_f(g(X0,X1),g(X0,X1))
| ~ big_f(X0,X1) ),
inference(copy,[status(esa)],[c_42]) ).
cnf(c_56,negated_conjecture,
( big_g(g(X0,X1),g(X0,X1))
| ~ big_f(g(X0,X1),g(X0,X1))
| ~ big_f(X0,X1) ),
inference(copy,[status(esa)],[c_55]) ).
cnf(c_70,negated_conjecture,
( big_g(g(X0,X1),g(X0,X1))
| ~ big_f(g(X0,X1),g(X0,X1))
| ~ big_f(X0,X1) ),
inference(copy,[status(esa)],[c_56]) ).
cnf(c_128,negated_conjecture,
( big_g(g(X0,X1),g(X0,X1))
| ~ big_f(X0,X1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_97,c_70]) ).
cnf(c_129,plain,
( big_g(g(X0,X1),g(X0,X1))
| ~ big_f(X0,X1) ),
inference(rewriting,[status(thm)],[c_128]) ).
cnf(c_1,negated_conjecture,
( ~ big_g(g(X0,X1),g(X0,X1))
| ~ big_g(X0,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_9ace24.p',c_0_29) ).
cnf(c_16,negated_conjecture,
( ~ big_g(g(X0,X1),g(X0,X1))
| ~ big_g(X0,X1) ),
inference(copy,[status(esa)],[c_1]) ).
cnf(c_43,negated_conjecture,
( ~ big_g(g(X0,X1),g(X0,X1))
| ~ big_g(X0,X1) ),
inference(copy,[status(esa)],[c_16]) ).
cnf(c_54,negated_conjecture,
( ~ big_g(g(X0,X1),g(X0,X1))
| ~ big_g(X0,X1) ),
inference(copy,[status(esa)],[c_43]) ).
cnf(c_57,negated_conjecture,
( ~ big_g(g(X0,X1),g(X0,X1))
| ~ big_g(X0,X1) ),
inference(copy,[status(esa)],[c_54]) ).
cnf(c_72,negated_conjecture,
( ~ big_g(g(X0,X1),g(X0,X1))
| ~ big_g(X0,X1) ),
inference(copy,[status(esa)],[c_57]) ).
cnf(c_136,plain,
( ~ big_g(X0,X1)
| ~ big_f(X0,X1) ),
inference(resolution,[status(thm)],[c_129,c_72]) ).
cnf(c_139,plain,
( ~ big_g(X0,X1)
| ~ big_f(X0,X1) ),
inference(rewriting,[status(thm)],[c_136]) ).
cnf(c_170,plain,
( ~ big_g(X0,g(X0,X0))
| ~ big_f(X0,X0) ),
inference(resolution,[status(thm)],[c_165,c_139]) ).
cnf(c_171,plain,
( ~ big_g(X0,g(X0,X0))
| ~ big_f(X0,X0) ),
inference(rewriting,[status(thm)],[c_170]) ).
cnf(c_176,plain,
~ big_f(X0,X0),
inference(forward_subsumption_resolution,[status(thm)],[c_171,c_155]) ).
cnf(c_177,plain,
~ big_f(X0,X0),
inference(rewriting,[status(thm)],[c_176]) ).
cnf(c_6,negated_conjecture,
( big_f(g(X0,X1),g(X0,X1))
| big_f(X0,X1) ),
file('/export/starexec/sandbox2/tmp/iprover_modulo_9ace24.p',c_0_34) ).
cnf(c_26,negated_conjecture,
( big_f(g(X0,X1),g(X0,X1))
| big_f(X0,X1) ),
inference(copy,[status(esa)],[c_6]) ).
cnf(c_48,negated_conjecture,
( big_f(g(X0,X1),g(X0,X1))
| big_f(X0,X1) ),
inference(copy,[status(esa)],[c_26]) ).
cnf(c_49,negated_conjecture,
( big_f(g(X0,X1),g(X0,X1))
| big_f(X0,X1) ),
inference(copy,[status(esa)],[c_48]) ).
cnf(c_62,negated_conjecture,
( big_f(g(X0,X1),g(X0,X1))
| big_f(X0,X1) ),
inference(copy,[status(esa)],[c_49]) ).
cnf(c_82,negated_conjecture,
( big_f(g(X0,X1),g(X0,X1))
| big_f(X0,X1) ),
inference(copy,[status(esa)],[c_62]) ).
cnf(c_179,negated_conjecture,
big_f(X0,X1),
inference(backward_subsumption_resolution,[status(thm)],[c_177,c_82]) ).
cnf(c_180,plain,
big_f(X0,X1),
inference(rewriting,[status(thm)],[c_179]) ).
cnf(c_189,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_180,c_177]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11 % Problem : SYN012-1 : TPTP v8.1.0. Released v1.1.0.
% 0.04/0.12 % Command : iprover_modulo %s %d
% 0.12/0.32 % Computer : n027.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Tue Jul 12 01:28:04 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.12/0.32 % Running in mono-core mode
% 0.17/0.38 % Orienting using strategy Equiv(ClausalAll)
% 0.17/0.38 % Orientation found
% 0.17/0.38 % 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_c85e9a.s --tptp_safe_out true --time_out_real 150 /export/starexec/sandbox2/tmp/iprover_modulo_9ace24.p | tee /export/starexec/sandbox2/tmp/iprover_modulo_out_85f07c | grep -v "SZS"
% 0.17/0.40
% 0.17/0.40 %---------------- iProver v2.5 (CASC-J8 2016) ----------------%
% 0.17/0.40
% 0.17/0.40 %
% 0.17/0.40 % ------ iProver source info
% 0.17/0.40
% 0.17/0.40 % git: sha1: 57accf6c58032223c7708532cf852a99fa48c1b3
% 0.17/0.40 % git: non_committed_changes: true
% 0.17/0.40 % git: last_make_outside_of_git: true
% 0.17/0.40
% 0.17/0.40 %
% 0.17/0.40 % ------ Input Options
% 0.17/0.40
% 0.17/0.40 % --out_options all
% 0.17/0.40 % --tptp_safe_out true
% 0.17/0.40 % --problem_path ""
% 0.17/0.40 % --include_path ""
% 0.17/0.40 % --clausifier .//eprover
% 0.17/0.40 % --clausifier_options --tstp-format
% 0.17/0.40 % --stdin false
% 0.17/0.40 % --dbg_backtrace false
% 0.17/0.40 % --dbg_dump_prop_clauses false
% 0.17/0.40 % --dbg_dump_prop_clauses_file -
% 0.17/0.40 % --dbg_out_stat false
% 0.17/0.40
% 0.17/0.40 % ------ General Options
% 0.17/0.40
% 0.17/0.40 % --fof false
% 0.17/0.40 % --time_out_real 150.
% 0.17/0.40 % --time_out_prep_mult 0.2
% 0.17/0.40 % --time_out_virtual -1.
% 0.17/0.40 % --schedule none
% 0.17/0.40 % --ground_splitting input
% 0.17/0.40 % --splitting_nvd 16
% 0.17/0.40 % --non_eq_to_eq false
% 0.17/0.40 % --prep_gs_sim true
% 0.17/0.40 % --prep_unflatten false
% 0.17/0.40 % --prep_res_sim true
% 0.17/0.40 % --prep_upred true
% 0.17/0.40 % --res_sim_input true
% 0.17/0.40 % --clause_weak_htbl true
% 0.17/0.40 % --gc_record_bc_elim false
% 0.17/0.40 % --symbol_type_check false
% 0.17/0.40 % --clausify_out false
% 0.17/0.40 % --large_theory_mode false
% 0.17/0.40 % --prep_sem_filter none
% 0.17/0.40 % --prep_sem_filter_out false
% 0.17/0.40 % --preprocessed_out false
% 0.17/0.40 % --sub_typing false
% 0.17/0.40 % --brand_transform false
% 0.17/0.40 % --pure_diseq_elim true
% 0.17/0.40 % --min_unsat_core false
% 0.17/0.40 % --pred_elim true
% 0.17/0.40 % --add_important_lit false
% 0.17/0.40 % --soft_assumptions false
% 0.17/0.40 % --reset_solvers false
% 0.17/0.40 % --bc_imp_inh []
% 0.17/0.40 % --conj_cone_tolerance 1.5
% 0.17/0.40 % --prolific_symb_bound 500
% 0.17/0.40 % --lt_threshold 2000
% 0.17/0.40
% 0.17/0.40 % ------ SAT Options
% 0.17/0.40
% 0.17/0.40 % --sat_mode false
% 0.17/0.40 % --sat_fm_restart_options ""
% 0.17/0.40 % --sat_gr_def false
% 0.17/0.40 % --sat_epr_types true
% 0.17/0.40 % --sat_non_cyclic_types false
% 0.17/0.40 % --sat_finite_models false
% 0.17/0.40 % --sat_fm_lemmas false
% 0.17/0.40 % --sat_fm_prep false
% 0.17/0.40 % --sat_fm_uc_incr true
% 0.17/0.40 % --sat_out_model small
% 0.17/0.40 % --sat_out_clauses false
% 0.17/0.40
% 0.17/0.40 % ------ QBF Options
% 0.17/0.40
% 0.17/0.40 % --qbf_mode false
% 0.17/0.40 % --qbf_elim_univ true
% 0.17/0.40 % --qbf_sk_in true
% 0.17/0.40 % --qbf_pred_elim true
% 0.17/0.40 % --qbf_split 32
% 0.17/0.40
% 0.17/0.40 % ------ BMC1 Options
% 0.17/0.40
% 0.17/0.40 % --bmc1_incremental false
% 0.17/0.40 % --bmc1_axioms reachable_all
% 0.17/0.40 % --bmc1_min_bound 0
% 0.17/0.40 % --bmc1_max_bound -1
% 0.17/0.40 % --bmc1_max_bound_default -1
% 0.17/0.40 % --bmc1_symbol_reachability true
% 0.17/0.40 % --bmc1_property_lemmas false
% 0.17/0.40 % --bmc1_k_induction false
% 0.17/0.40 % --bmc1_non_equiv_states false
% 0.17/0.40 % --bmc1_deadlock false
% 0.17/0.40 % --bmc1_ucm false
% 0.17/0.40 % --bmc1_add_unsat_core none
% 0.17/0.40 % --bmc1_unsat_core_children false
% 0.17/0.40 % --bmc1_unsat_core_extrapolate_axioms false
% 0.17/0.40 % --bmc1_out_stat full
% 0.17/0.40 % --bmc1_ground_init false
% 0.17/0.40 % --bmc1_pre_inst_next_state false
% 0.17/0.40 % --bmc1_pre_inst_state false
% 0.17/0.40 % --bmc1_pre_inst_reach_state false
% 0.17/0.40 % --bmc1_out_unsat_core false
% 0.17/0.40 % --bmc1_aig_witness_out false
% 0.17/0.40 % --bmc1_verbose false
% 0.17/0.40 % --bmc1_dump_clauses_tptp false
% 0.17/0.40 % --bmc1_dump_unsat_core_tptp false
% 0.17/0.40 % --bmc1_dump_file -
% 0.17/0.40 % --bmc1_ucm_expand_uc_limit 128
% 0.17/0.40 % --bmc1_ucm_n_expand_iterations 6
% 0.17/0.40 % --bmc1_ucm_extend_mode 1
% 0.17/0.40 % --bmc1_ucm_init_mode 2
% 0.17/0.40 % --bmc1_ucm_cone_mode none
% 0.17/0.40 % --bmc1_ucm_reduced_relation_type 0
% 0.17/0.40 % --bmc1_ucm_relax_model 4
% 0.17/0.40 % --bmc1_ucm_full_tr_after_sat true
% 0.17/0.40 % --bmc1_ucm_expand_neg_assumptions false
% 0.17/0.40 % --bmc1_ucm_layered_model none
% 0.17/0.40 % --bmc1_ucm_max_lemma_size 10
% 0.17/0.40
% 0.17/0.40 % ------ AIG Options
% 0.17/0.40
% 0.17/0.40 % --aig_mode false
% 0.17/0.40
% 0.17/0.40 % ------ Instantiation Options
% 0.17/0.40
% 0.17/0.40 % --instantiation_flag true
% 0.17/0.40 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.17/0.40 % --inst_solver_per_active 750
% 0.17/0.40 % --inst_solver_calls_frac 0.5
% 0.17/0.40 % --inst_passive_queue_type priority_queues
% 0.17/0.40 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.17/0.40 % --inst_passive_queues_freq [25;2]
% 0.17/0.40 % --inst_dismatching true
% 0.17/0.40 % --inst_eager_unprocessed_to_passive true
% 0.17/0.40 % --inst_prop_sim_given true
% 0.17/0.40 % --inst_prop_sim_new false
% 0.17/0.40 % --inst_orphan_elimination true
% 0.17/0.40 % --inst_learning_loop_flag true
% 0.17/0.40 % --inst_learning_start 3000
% 0.17/0.40 % --inst_learning_factor 2
% 0.17/0.40 % --inst_start_prop_sim_after_learn 3
% 0.17/0.40 % --inst_sel_renew solver
% 0.17/0.40 % --inst_lit_activity_flag true
% 0.17/0.40 % --inst_out_proof true
% 0.17/0.40
% 0.17/0.40 % ------ Resolution Options
% 0.17/0.40
% 0.17/0.40 % --resolution_flag true
% 0.17/0.40 % --res_lit_sel kbo_max
% 0.17/0.40 % --res_to_prop_solver none
% 0.17/0.40 % --res_prop_simpl_new false
% 0.17/0.40 % --res_prop_simpl_given false
% 0.17/0.40 % --res_passive_queue_type priority_queues
% 0.17/0.40 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.17/0.40 % --res_passive_queues_freq [15;5]
% 0.17/0.40 % --res_forward_subs full
% 0.17/0.40 % --res_backward_subs full
% 0.17/0.40 % --res_forward_subs_resolution true
% 0.17/0.40 % --res_backward_subs_resolution true
% 0.17/0.40 % --res_orphan_elimination false
% 0.17/0.40 % --res_time_limit 1000.
% 0.17/0.40 % --res_out_proof true
% 0.17/0.40 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_c85e9a.s
% 0.17/0.40 % --modulo true
% 0.17/0.40
% 0.17/0.40 % ------ Combination Options
% 0.17/0.40
% 0.17/0.40 % --comb_res_mult 1000
% 0.17/0.40 % --comb_inst_mult 300
% 0.17/0.40 % ------
% 0.17/0.40
% 0.17/0.40 % ------ Parsing...% successful
% 0.17/0.40
% 0.17/0.40 % ------ 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.17/0.40
% 0.17/0.40 % ------ Proving...
% 0.17/0.40 % ------ Problem Properties
% 0.17/0.40
% 0.17/0.40 %
% 0.17/0.40 % EPR false
% 0.17/0.40 % Horn false
% 0.17/0.40 % Has equality false
% 0.17/0.40
% 0.17/0.40 % % ------ Input Options Time Limit: Unbounded
% 0.17/0.40
% 0.17/0.40
% 0.17/0.40 % % ------ Current options:
% 0.17/0.40
% 0.17/0.40 % ------ Input Options
% 0.17/0.40
% 0.17/0.40 % --out_options all
% 0.17/0.40 % --tptp_safe_out true
% 0.17/0.40 % --problem_path ""
% 0.17/0.40 % --include_path ""
% 0.17/0.40 % --clausifier .//eprover
% 0.17/0.40 % --clausifier_options --tstp-format
% 0.17/0.40 % --stdin false
% 0.17/0.40 % --dbg_backtrace false
% 0.17/0.40 % --dbg_dump_prop_clauses false
% 0.17/0.40 % --dbg_dump_prop_clauses_file -
% 0.17/0.40 % --dbg_out_stat false
% 0.17/0.40
% 0.17/0.40 % ------ General Options
% 0.17/0.40
% 0.17/0.40 % --fof false
% 0.17/0.40 % --time_out_real 150.
% 0.17/0.40 % --time_out_prep_mult 0.2
% 0.17/0.40 % --time_out_virtual -1.
% 0.17/0.40 % --schedule none
% 0.17/0.40 % --ground_splitting input
% 0.17/0.40 % --splitting_nvd 16
% 0.17/0.40 % --non_eq_to_eq false
% 0.17/0.40 % --prep_gs_sim true
% 0.17/0.40 % --prep_unflatten false
% 0.17/0.40 % --prep_res_sim true
% 0.17/0.40 % --prep_upred true
% 0.17/0.40 % --res_sim_input true
% 0.17/0.40 % --clause_weak_htbl true
% 0.17/0.40 % --gc_record_bc_elim false
% 0.17/0.40 % --symbol_type_check false
% 0.17/0.40 % --clausify_out false
% 0.17/0.40 % --large_theory_mode false
% 0.17/0.40 % --prep_sem_filter none
% 0.17/0.40 % --prep_sem_filter_out false
% 0.17/0.40 % --preprocessed_out false
% 0.17/0.40 % --sub_typing false
% 0.17/0.40 % --brand_transform false
% 0.17/0.40 % --pure_diseq_elim true
% 0.17/0.40 % --min_unsat_core false
% 0.17/0.40 % --pred_elim true
% 0.17/0.40 % --add_important_lit false
% 0.17/0.40 % --soft_assumptions false
% 0.17/0.40 % --reset_solvers false
% 0.17/0.40 % --bc_imp_inh []
% 0.17/0.40 % --conj_cone_tolerance 1.5
% 0.17/0.40 % --prolific_symb_bound 500
% 0.17/0.40 % --lt_threshold 2000
% 0.17/0.40
% 0.17/0.40 % ------ SAT Options
% 0.17/0.40
% 0.17/0.40 % --sat_mode false
% 0.17/0.40 % --sat_fm_restart_options ""
% 0.17/0.40 % --sat_gr_def false
% 0.17/0.40 % --sat_epr_types true
% 0.17/0.40 % --sat_non_cyclic_types false
% 0.17/0.40 % --sat_finite_models false
% 0.17/0.40 % --sat_fm_lemmas false
% 0.17/0.40 % --sat_fm_prep false
% 0.17/0.40 % --sat_fm_uc_incr true
% 0.17/0.40 % --sat_out_model small
% 0.17/0.40 % --sat_out_clauses false
% 0.17/0.40
% 0.17/0.40 % ------ QBF Options
% 0.17/0.40
% 0.17/0.40 % --qbf_mode false
% 0.17/0.40 % --qbf_elim_univ true
% 0.17/0.40 % --qbf_sk_in true
% 0.17/0.40 % --qbf_pred_elim true
% 0.17/0.40 % --qbf_split 32
% 0.17/0.40
% 0.17/0.40 % ------ BMC1 Options
% 0.17/0.40
% 0.17/0.40 % --bmc1_incremental false
% 0.17/0.40 % --bmc1_axioms reachable_all
% 0.17/0.40 % --bmc1_min_bound 0
% 0.17/0.40 % --bmc1_max_bound -1
% 0.17/0.40 % --bmc1_max_bound_default -1
% 0.17/0.40 % --bmc1_symbol_reachability true
% 0.17/0.40 % --bmc1_property_lemmas false
% 0.17/0.40 % --bmc1_k_induction false
% 0.17/0.40 % --bmc1_non_equiv_states false
% 0.17/0.40 % --bmc1_deadlock false
% 0.17/0.40 % --bmc1_ucm false
% 0.17/0.40 % --bmc1_add_unsat_core none
% 0.17/0.40 % --bmc1_unsat_core_children false
% 0.17/0.40 % --bmc1_unsat_core_extrapolate_axioms false
% 0.17/0.40 % --bmc1_out_stat full
% 0.17/0.40 % --bmc1_ground_init false
% 0.17/0.40 % --bmc1_pre_inst_next_state false
% 0.17/0.40 % --bmc1_pre_inst_state false
% 0.17/0.40 % --bmc1_pre_inst_reach_state false
% 0.17/0.40 % --bmc1_out_unsat_core false
% 0.17/0.40 % --bmc1_aig_witness_out false
% 0.17/0.40 % --bmc1_verbose false
% 0.17/0.40 % --bmc1_dump_clauses_tptp false
% 0.17/0.40 % --bmc1_dump_unsat_core_tptp false
% 0.17/0.40 % --bmc1_dump_file -
% 0.17/0.40 % --bmc1_ucm_expand_uc_limit 128
% 0.17/0.40 % --bmc1_ucm_n_expand_iterations 6
% 0.17/0.40 % --bmc1_ucm_extend_mode 1
% 0.17/0.40 % --bmc1_ucm_init_mode 2
% 0.17/0.40 % --bmc1_ucm_cone_mode none
% 0.17/0.40 % --bmc1_ucm_reduced_relation_type 0
% 0.17/0.40 % --bmc1_ucm_relax_model 4
% 0.17/0.40 % --bmc1_ucm_full_tr_after_sat true
% 0.17/0.40 % --bmc1_ucm_expand_neg_assumptions false
% 0.17/0.40 % --bmc1_ucm_layered_model none
% 0.17/0.40 % --bmc1_ucm_max_lemma_size 10
% 0.17/0.40
% 0.17/0.40 % ------ AIG Options
% 0.17/0.40
% 0.17/0.40 % --aig_mode false
% 0.17/0.40
% 0.17/0.40 % ------ Instantiation Options
% 0.17/0.40
% 0.17/0.40 % --instantiation_flag true
% 0.17/0.40 % --inst_lit_sel [+prop;+sign;+ground;-num_var;-num_symb]
% 0.17/0.40 % --inst_solver_per_active 750
% 0.17/0.40 % --inst_solver_calls_frac 0.5
% 0.17/0.40 % --inst_passive_queue_type priority_queues
% 0.17/0.40 % --inst_passive_queues [[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]
% 0.17/0.40 % --inst_passive_queues_freq [25;2]
% 0.17/0.40 % --inst_dismatching true
% 0.17/0.40 % --inst_eager_unprocessed_to_passive true
% 0.17/0.40 % --inst_prop_sim_given true
% 0.17/0.41 % --inst_prop_sim_new false
% 0.17/0.41 % --inst_orphan_elimination true
% 0.17/0.41 % --inst_learning_loop_flag true
% 0.17/0.41 % --inst_learning_start 3000
% 0.17/0.41 % --inst_learning_factor 2
% 0.17/0.41 % --inst_start_prop_sim_after_learn 3
% 0.17/0.41 % --inst_sel_renew solver
% 0.17/0.41 % --inst_lit_activity_flag true
% 0.17/0.41 % --inst_out_proof true
% 0.17/0.41
% 0.17/0.41 % ------ Resolution Options
% 0.17/0.41
% 0.17/0.41 % --resolution_flag true
% 0.17/0.41 % --res_lit_sel kbo_max
% 0.17/0.41 % --res_to_prop_solver none
% 0.17/0.41 % --res_prop_simpl_new false
% 0.17/0.41 % --res_prop_simpl_given false
% 0.17/0.41 % --res_passive_queue_type priority_queues
% 0.17/0.41 % --res_passive_queues [[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]
% 0.17/0.41 % --res_passive_queues_freq [15;5]
% 0.17/0.41 % --res_forward_subs full
% 0.17/0.41 % --res_backward_subs full
% 0.17/0.41 % --res_forward_subs_resolution true
% 0.17/0.41 % --res_backward_subs_resolution true
% 0.17/0.41 % --res_orphan_elimination false
% 0.17/0.41 % --res_time_limit 1000.
% 0.17/0.41 % --res_out_proof true
% 0.17/0.41 % --proof_out_file /export/starexec/sandbox2/tmp/iprover_proof_c85e9a.s
% 0.17/0.41 % --modulo true
% 0.17/0.41
% 0.17/0.41 % ------ Combination Options
% 0.17/0.41
% 0.17/0.41 % --comb_res_mult 1000
% 0.17/0.41 % --comb_inst_mult 300
% 0.17/0.41 % ------
% 0.17/0.41
% 0.17/0.41
% 0.17/0.41
% 0.17/0.41 % ------ Proving...
% 0.17/0.41 %
% 0.17/0.41
% 0.17/0.41
% 0.17/0.41 % Resolution empty clause
% 0.17/0.41
% 0.17/0.41 % ------ Statistics
% 0.17/0.41
% 0.17/0.41 % ------ General
% 0.17/0.41
% 0.17/0.41 % num_of_input_clauses: 7
% 0.17/0.41 % num_of_input_neg_conjectures: 7
% 0.17/0.41 % num_of_splits: 0
% 0.17/0.41 % num_of_split_atoms: 0
% 0.17/0.41 % num_of_sem_filtered_clauses: 0
% 0.17/0.41 % num_of_subtypes: 0
% 0.17/0.41 % monotx_restored_types: 0
% 0.17/0.41 % sat_num_of_epr_types: 0
% 0.17/0.41 % sat_num_of_non_cyclic_types: 0
% 0.17/0.41 % sat_guarded_non_collapsed_types: 0
% 0.17/0.41 % is_epr: 0
% 0.17/0.41 % is_horn: 0
% 0.17/0.41 % has_eq: 0
% 0.17/0.41 % num_pure_diseq_elim: 0
% 0.17/0.41 % simp_replaced_by: 0
% 0.17/0.41 % res_preprocessed: 14
% 0.17/0.41 % prep_upred: 0
% 0.17/0.41 % prep_unflattend: 0
% 0.17/0.41 % pred_elim_cands: 0
% 0.17/0.41 % pred_elim: 0
% 0.17/0.41 % pred_elim_cl: 0
% 0.17/0.41 % pred_elim_cycles: 0
% 0.17/0.41 % forced_gc_time: 0
% 0.17/0.41 % gc_basic_clause_elim: 0
% 0.17/0.41 % parsing_time: 0.
% 0.17/0.41 % sem_filter_time: 0.
% 0.17/0.41 % pred_elim_time: 0.
% 0.17/0.41 % out_proof_time: 0.003
% 0.17/0.41 % monotx_time: 0.
% 0.17/0.41 % subtype_inf_time: 0.
% 0.17/0.41 % unif_index_cands_time: 0.
% 0.17/0.41 % unif_index_add_time: 0.
% 0.17/0.41 % total_time: 0.025
% 0.17/0.41 % num_of_symbols: 28
% 0.17/0.41 % num_of_terms: 53
% 0.17/0.41
% 0.17/0.41 % ------ Propositional Solver
% 0.17/0.41
% 0.17/0.41 % prop_solver_calls: 1
% 0.17/0.41 % prop_fast_solver_calls: 51
% 0.17/0.41 % prop_num_of_clauses: 14
% 0.17/0.41 % prop_preprocess_simplified: 126
% 0.17/0.41 % prop_fo_subsumed: 0
% 0.17/0.41 % prop_solver_time: 0.
% 0.17/0.41 % prop_fast_solver_time: 0.
% 0.17/0.41 % prop_unsat_core_time: 0.
% 0.17/0.41
% 0.17/0.41 % ------ QBF
% 0.17/0.41
% 0.17/0.41 % qbf_q_res: 0
% 0.17/0.41 % qbf_num_tautologies: 0
% 0.17/0.41 % qbf_prep_cycles: 0
% 0.17/0.41
% 0.17/0.41 % ------ BMC1
% 0.17/0.41
% 0.17/0.41 % bmc1_current_bound: -1
% 0.17/0.41 % bmc1_last_solved_bound: -1
% 0.17/0.41 % bmc1_unsat_core_size: -1
% 0.17/0.41 % bmc1_unsat_core_parents_size: -1
% 0.17/0.41 % bmc1_merge_next_fun: 0
% 0.17/0.41 % bmc1_unsat_core_clauses_time: 0.
% 0.17/0.41
% 0.17/0.41 % ------ Instantiation
% 0.17/0.41
% 0.17/0.41 % inst_num_of_clauses: 7
% 0.17/0.41 % inst_num_in_passive: 0
% 0.17/0.41 % inst_num_in_active: 0
% 0.17/0.41 % inst_num_in_unprocessed: 7
% 0.17/0.41 % inst_num_of_loops: 0
% 0.17/0.41 % inst_num_of_learning_restarts: 0
% 0.17/0.41 % inst_num_moves_active_passive: 0
% 0.17/0.41 % inst_lit_activity: 0
% 0.17/0.41 % inst_lit_activity_moves: 0
% 0.17/0.41 % inst_num_tautologies: 0
% 0.17/0.41 % inst_num_prop_implied: 0
% 0.17/0.41 % inst_num_existing_simplified: 0
% 0.17/0.41 % inst_num_eq_res_simplified: 0
% 0.17/0.41 % inst_num_child_elim: 0
% 0.17/0.41 % inst_num_of_dismatching_blockings: 0
% 0.17/0.41 % inst_num_of_non_proper_insts: 0
% 0.17/0.41 % inst_num_of_duplicates: 0
% 0.17/0.41 % inst_inst_num_from_inst_to_res: 0
% 0.17/0.41 % inst_dismatching_checking_time: 0.
% 0.17/0.41
% 0.17/0.41 % ------ Resolution
% 0.17/0.41
% 0.17/0.41 % res_num_of_clauses: 5
% 0.17/0.41 % res_num_in_passive: 1
% 0.17/0.41 % res_num_in_active: 3
% 0.17/0.41 % res_num_of_loops: 17
% 0.17/0.41 % res_forward_subset_subsumed: 2
% 0.17/0.41 % res_backward_subset_subsumed: 0
% 0.17/0.41 % res_forward_subsumed: 2
% 0.17/0.41 % res_backward_subsumed: 5
% 0.17/0.41 % res_forward_subsumption_resolution: 1
% 0.17/0.41 % res_backward_subsumption_resolution: 7
% 0.17/0.41 % res_clause_to_clause_subsumption: 50
% 0.17/0.41 % res_orphan_elimination: 0
% 0.17/0.41 % res_tautology_del: 4
% 0.17/0.41 % res_num_eq_res_simplified: 0
% 0.17/0.41 % res_num_sel_changes: 0
% 0.17/0.41 % res_moves_from_active_to_pass: 0
% 0.17/0.41
% 0.17/0.41 % Status Unsatisfiable
% 0.17/0.41 % SZS status Unsatisfiable
% 0.17/0.41 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------