TSTP Solution File: SEU156+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU156+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 17:04:11 EDT 2023
% Result : Theorem 7.72s 1.63s
% Output : CNFRefutation 7.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 11
% Syntax : Number of formulae : 79 ( 24 unt; 0 def)
% Number of atoms : 253 ( 202 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 270 ( 96 ~; 121 |; 43 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 142 ( 6 sgn; 98 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f7,axiom,
! [X0,X1] :
( singleton(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> X0 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(f10,axiom,
! [X0,X1,X2] :
( unordered_pair(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( X1 = X3
| X0 = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(f16,axiom,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(f48,axiom,
! [X0,X1,X2,X3] :
~ ( X0 != X3
& X0 != X2
& unordered_pair(X0,X1) = unordered_pair(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_zfmisc_1) ).
fof(f61,conjecture,
! [X0,X1,X2,X3] :
( ordered_pair(X0,X1) = ordered_pair(X2,X3)
=> ( X1 = X3
& X0 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t33_zfmisc_1) ).
fof(f62,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( ordered_pair(X0,X1) = ordered_pair(X2,X3)
=> ( X1 = X3
& X0 = X2 ) ),
inference(negated_conjecture,[],[f61]) ).
fof(f76,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f84,axiom,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(f107,plain,
! [X0,X1,X2,X3] :
( X0 = X3
| X0 = X2
| unordered_pair(X0,X1) != unordered_pair(X2,X3) ),
inference(ennf_transformation,[],[f48]) ).
fof(f117,plain,
? [X0,X1,X2,X3] :
( ( X1 != X3
| X0 != X2 )
& ordered_pair(X0,X1) = ordered_pair(X2,X3) ),
inference(ennf_transformation,[],[f62]) ).
fof(f131,plain,
! [X0,X1,X2] :
( X0 = X1
| singleton(X0) != unordered_pair(X1,X2) ),
inference(ennf_transformation,[],[f84]) ).
fof(f135,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| X0 != X2 )
& ( X0 = X2
| ~ in(X2,X1) ) )
| singleton(X0) != X1 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f136,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(rectify,[],[f135]) ).
fof(f137,plain,
! [X0,X1] :
( ? [X2] :
( ( X0 != X2
| ~ in(X2,X1) )
& ( X0 = X2
| in(X2,X1) ) )
=> ( ( sK0(X0,X1) != X0
| ~ in(sK0(X0,X1),X1) )
& ( sK0(X0,X1) = X0
| in(sK0(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f138,plain,
! [X0,X1] :
( ( singleton(X0) = X1
| ( ( sK0(X0,X1) != X0
| ~ in(sK0(X0,X1),X1) )
& ( sK0(X0,X1) = X0
| in(sK0(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| X0 != X3 )
& ( X0 = X3
| ~ in(X3,X1) ) )
| singleton(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f136,f137]) ).
fof(f147,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X1 != X3
& X0 != X3 ) )
& ( X1 = X3
| X0 = X3
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f148,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X1 != X3
& X0 != X3 ) )
& ( X1 = X3
| X0 = X3
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(flattening,[],[f147]) ).
fof(f149,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X1 != X4
& X0 != X4 ) )
& ( X1 = X4
| X0 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(rectify,[],[f148]) ).
fof(f150,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) )
=> ( ( ( sK3(X0,X1,X2) != X1
& sK3(X0,X1,X2) != X0 )
| ~ in(sK3(X0,X1,X2),X2) )
& ( sK3(X0,X1,X2) = X1
| sK3(X0,X1,X2) = X0
| in(sK3(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f151,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ( ( ( sK3(X0,X1,X2) != X1
& sK3(X0,X1,X2) != X0 )
| ~ in(sK3(X0,X1,X2),X2) )
& ( sK3(X0,X1,X2) = X1
| sK3(X0,X1,X2) = X0
| in(sK3(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X1 != X4
& X0 != X4 ) )
& ( X1 = X4
| X0 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f149,f150]) ).
fof(f189,plain,
( ? [X0,X1,X2,X3] :
( ( X1 != X3
| X0 != X2 )
& ordered_pair(X0,X1) = ordered_pair(X2,X3) )
=> ( ( sK15 != sK17
| sK14 != sK16 )
& ordered_pair(sK14,sK15) = ordered_pair(sK16,sK17) ) ),
introduced(choice_axiom,[]) ).
fof(f190,plain,
( ( sK15 != sK17
| sK14 != sK16 )
& ordered_pair(sK14,sK15) = ordered_pair(sK16,sK17) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK14,sK15,sK16,sK17])],[f117,f189]) ).
fof(f199,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f205,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| singleton(X0) != X1 ),
inference(cnf_transformation,[],[f138]) ).
fof(f217,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X1 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f151]) ).
fof(f248,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
inference(cnf_transformation,[],[f16]) ).
fof(f276,plain,
! [X2,X3,X0,X1] :
( X0 = X3
| X0 = X2
| unordered_pair(X0,X1) != unordered_pair(X2,X3) ),
inference(cnf_transformation,[],[f107]) ).
fof(f290,plain,
ordered_pair(sK14,sK15) = ordered_pair(sK16,sK17),
inference(cnf_transformation,[],[f190]) ).
fof(f291,plain,
( sK15 != sK17
| sK14 != sK16 ),
inference(cnf_transformation,[],[f190]) ).
fof(f309,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f76]) ).
fof(f318,plain,
! [X2,X0,X1] :
( X0 = X1
| singleton(X0) != unordered_pair(X1,X2) ),
inference(cnf_transformation,[],[f131]) ).
fof(f320,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),unordered_pair(X0,X0)),
inference(definition_unfolding,[],[f248,f309]) ).
fof(f325,plain,
! [X3,X0,X1] :
( X0 = X3
| ~ in(X3,X1)
| unordered_pair(X0,X0) != X1 ),
inference(definition_unfolding,[],[f205,f309]) ).
fof(f352,plain,
unordered_pair(unordered_pair(sK14,sK15),unordered_pair(sK14,sK14)) = unordered_pair(unordered_pair(sK16,sK17),unordered_pair(sK16,sK16)),
inference(definition_unfolding,[],[f290,f320,f320]) ).
fof(f356,plain,
! [X2,X0,X1] :
( X0 = X1
| unordered_pair(X0,X0) != unordered_pair(X1,X2) ),
inference(definition_unfolding,[],[f318,f309]) ).
fof(f362,plain,
! [X3,X0] :
( X0 = X3
| ~ in(X3,unordered_pair(X0,X0)) ),
inference(equality_resolution,[],[f325]) ).
fof(f366,plain,
! [X2,X0,X4] :
( in(X4,X2)
| unordered_pair(X0,X4) != X2 ),
inference(equality_resolution,[],[f217]) ).
fof(f367,plain,
! [X0,X4] : in(X4,unordered_pair(X0,X4)),
inference(equality_resolution,[],[f366]) ).
cnf(c_51,plain,
unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f199]) ).
cnf(c_60,plain,
( ~ in(X0,unordered_pair(X1,X1))
| X0 = X1 ),
inference(cnf_transformation,[],[f362]) ).
cnf(c_70,plain,
in(X0,unordered_pair(X1,X0)),
inference(cnf_transformation,[],[f367]) ).
cnf(c_127,plain,
( unordered_pair(X0,X1) != unordered_pair(X2,X3)
| X0 = X2
| X0 = X3 ),
inference(cnf_transformation,[],[f276]) ).
cnf(c_141,negated_conjecture,
( sK15 != sK17
| sK14 != sK16 ),
inference(cnf_transformation,[],[f291]) ).
cnf(c_142,negated_conjecture,
unordered_pair(unordered_pair(sK14,sK15),unordered_pair(sK14,sK14)) = unordered_pair(unordered_pair(sK16,sK17),unordered_pair(sK16,sK16)),
inference(cnf_transformation,[],[f352]) ).
cnf(c_167,plain,
( unordered_pair(X0,X0) != unordered_pair(X1,X2)
| X0 = X1 ),
inference(cnf_transformation,[],[f356]) ).
cnf(c_1338,plain,
unordered_pair(unordered_pair(sK14,sK14),unordered_pair(sK14,sK15)) = unordered_pair(unordered_pair(sK16,sK16),unordered_pair(sK16,sK17)),
inference(demodulation,[status(thm)],[c_142,c_51]) ).
cnf(c_4580,plain,
( unordered_pair(X0,X1) != unordered_pair(X2,X3)
| X1 = X2
| X1 = X3 ),
inference(superposition,[status(thm)],[c_51,c_127]) ).
cnf(c_4583,plain,
( unordered_pair(unordered_pair(sK14,sK14),unordered_pair(sK14,sK15)) != unordered_pair(X0,X1)
| unordered_pair(sK16,sK16) = X0
| unordered_pair(sK16,sK16) = X1 ),
inference(superposition,[status(thm)],[c_1338,c_127]) ).
cnf(c_4682,plain,
( unordered_pair(sK14,sK15) = unordered_pair(sK16,sK16)
| unordered_pair(sK14,sK14) = unordered_pair(sK16,sK16) ),
inference(equality_resolution,[status(thm)],[c_4583]) ).
cnf(c_4712,plain,
( unordered_pair(X0,X1) != unordered_pair(sK14,sK15)
| unordered_pair(sK14,sK14) = unordered_pair(sK16,sK16)
| X0 = sK16 ),
inference(superposition,[status(thm)],[c_4682,c_127]) ).
cnf(c_4852,plain,
( unordered_pair(unordered_pair(sK14,sK14),unordered_pair(sK14,sK15)) != unordered_pair(X0,X1)
| unordered_pair(sK16,sK17) = X0
| unordered_pair(sK16,sK17) = X1 ),
inference(superposition,[status(thm)],[c_1338,c_4580]) ).
cnf(c_4968,plain,
( unordered_pair(sK14,sK15) = unordered_pair(sK16,sK17)
| unordered_pair(sK14,sK14) = unordered_pair(sK16,sK17) ),
inference(equality_resolution,[status(thm)],[c_4852]) ).
cnf(c_4977,plain,
( unordered_pair(X0,X1) != unordered_pair(sK14,sK15)
| unordered_pair(sK14,sK14) = unordered_pair(sK16,sK17)
| X0 = sK17
| X1 = sK17 ),
inference(superposition,[status(thm)],[c_4968,c_4580]) ).
cnf(c_4978,plain,
( unordered_pair(X0,X1) != unordered_pair(sK14,sK15)
| unordered_pair(sK14,sK14) = unordered_pair(sK16,sK17)
| X0 = sK16
| X1 = sK16 ),
inference(superposition,[status(thm)],[c_4968,c_127]) ).
cnf(c_4983,plain,
( unordered_pair(X0,X1) != unordered_pair(sK14,sK15)
| unordered_pair(sK14,sK14) = unordered_pair(sK16,sK17)
| X1 = sK17
| X1 = sK16 ),
inference(superposition,[status(thm)],[c_4968,c_4580]) ).
cnf(c_5544,plain,
( unordered_pair(sK14,sK14) = unordered_pair(sK16,sK16)
| sK14 = sK16 ),
inference(equality_resolution,[status(thm)],[c_4712]) ).
cnf(c_6295,plain,
( unordered_pair(sK14,sK14) = unordered_pair(sK16,sK17)
| sK15 = sK17
| sK17 = sK14 ),
inference(equality_resolution,[status(thm)],[c_4977]) ).
cnf(c_6339,plain,
( unordered_pair(sK14,sK14) = unordered_pair(sK16,sK17)
| sK15 = sK16
| sK14 = sK16 ),
inference(equality_resolution,[status(thm)],[c_4978]) ).
cnf(c_6391,plain,
( unordered_pair(sK14,sK14) = unordered_pair(sK16,sK17)
| sK15 = sK17
| sK15 = sK16 ),
inference(equality_resolution,[status(thm)],[c_4983]) ).
cnf(c_20595,plain,
sK14 = sK16,
inference(forward_subsumption_resolution,[status(thm)],[c_5544,c_167]) ).
cnf(c_20744,plain,
unordered_pair(unordered_pair(sK14,sK14),unordered_pair(sK14,sK15)) = unordered_pair(unordered_pair(sK14,sK14),unordered_pair(sK14,sK17)),
inference(demodulation,[status(thm)],[c_1338,c_20595]) ).
cnf(c_20745,plain,
( sK15 != sK17
| sK14 != sK14 ),
inference(demodulation,[status(thm)],[c_141,c_20595]) ).
cnf(c_20746,plain,
sK15 != sK17,
inference(equality_resolution_simp,[status(thm)],[c_20745]) ).
cnf(c_25681,plain,
( unordered_pair(sK14,sK14) = unordered_pair(sK16,sK17)
| sK17 = sK14 ),
inference(global_subsumption_just,[status(thm)],[c_6295,c_6295,c_20746]) ).
cnf(c_25683,plain,
( unordered_pair(sK14,sK17) = unordered_pair(sK14,sK14)
| sK17 = sK14 ),
inference(light_normalisation,[status(thm)],[c_25681,c_20595]) ).
cnf(c_25690,plain,
( sK17 = sK14
| in(sK17,unordered_pair(sK14,sK14)) ),
inference(superposition,[status(thm)],[c_25683,c_70]) ).
cnf(c_27144,plain,
( sK15 = sK16
| unordered_pair(sK14,sK14) = unordered_pair(sK16,sK17) ),
inference(global_subsumption_just,[status(thm)],[c_6339,c_6391,c_20746]) ).
cnf(c_27145,plain,
( unordered_pair(sK14,sK14) = unordered_pair(sK16,sK17)
| sK15 = sK16 ),
inference(renaming,[status(thm)],[c_27144]) ).
cnf(c_27146,plain,
( unordered_pair(sK14,sK17) = unordered_pair(sK14,sK14)
| sK15 = sK14 ),
inference(light_normalisation,[status(thm)],[c_27145,c_20595]) ).
cnf(c_27192,plain,
( unordered_pair(unordered_pair(sK14,sK14),unordered_pair(sK14,sK15)) = unordered_pair(unordered_pair(sK14,sK14),unordered_pair(sK14,sK14))
| sK15 = sK14 ),
inference(superposition,[status(thm)],[c_27146,c_20744]) ).
cnf(c_27815,plain,
( sK15 = sK14
| in(unordered_pair(sK14,sK15),unordered_pair(unordered_pair(sK14,sK14),unordered_pair(sK14,sK14))) ),
inference(superposition,[status(thm)],[c_27192,c_70]) ).
cnf(c_30077,plain,
sK17 = sK14,
inference(forward_subsumption_resolution,[status(thm)],[c_25690,c_60]) ).
cnf(c_30136,plain,
sK15 != sK14,
inference(demodulation,[status(thm)],[c_20746,c_30077]) ).
cnf(c_30192,plain,
in(unordered_pair(sK14,sK15),unordered_pair(unordered_pair(sK14,sK14),unordered_pair(sK14,sK14))),
inference(backward_subsumption_resolution,[status(thm)],[c_27815,c_30136]) ).
cnf(c_30291,plain,
unordered_pair(sK14,sK15) = unordered_pair(sK14,sK14),
inference(superposition,[status(thm)],[c_30192,c_60]) ).
cnf(c_30310,plain,
in(sK15,unordered_pair(sK14,sK14)),
inference(superposition,[status(thm)],[c_30291,c_70]) ).
cnf(c_30376,plain,
sK15 = sK14,
inference(superposition,[status(thm)],[c_30310,c_60]) ).
cnf(c_30378,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_30376,c_30136]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU156+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Aug 23 16:01:31 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 7.72/1.63 % SZS status Started for theBenchmark.p
% 7.72/1.63 % SZS status Theorem for theBenchmark.p
% 7.72/1.63
% 7.72/1.63 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 7.72/1.63
% 7.72/1.63 ------ iProver source info
% 7.72/1.63
% 7.72/1.63 git: date: 2023-05-31 18:12:56 +0000
% 7.72/1.63 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 7.72/1.63 git: non_committed_changes: false
% 7.72/1.63 git: last_make_outside_of_git: false
% 7.72/1.63
% 7.72/1.63 ------ Parsing...
% 7.72/1.63 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.72/1.63
% 7.72/1.63 ------ Preprocessing... sup_sim: 4 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 7.72/1.63
% 7.72/1.63 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.72/1.63
% 7.72/1.63 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.72/1.63 ------ Proving...
% 7.72/1.63 ------ Problem Properties
% 7.72/1.63
% 7.72/1.63
% 7.72/1.63 clauses 109
% 7.72/1.63 conjectures 1
% 7.72/1.63 EPR 22
% 7.72/1.63 Horn 84
% 7.72/1.63 unary 25
% 7.72/1.63 binary 46
% 7.72/1.63 lits 236
% 7.72/1.63 lits eq 70
% 7.72/1.63 fd_pure 0
% 7.72/1.63 fd_pseudo 0
% 7.72/1.63 fd_cond 3
% 7.72/1.63 fd_pseudo_cond 29
% 7.72/1.63 AC symbols 0
% 7.72/1.63
% 7.72/1.63 ------ Schedule dynamic 5 is on
% 7.72/1.63
% 7.72/1.63 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.72/1.63
% 7.72/1.63
% 7.72/1.63 ------
% 7.72/1.63 Current options:
% 7.72/1.63 ------
% 7.72/1.63
% 7.72/1.63
% 7.72/1.63
% 7.72/1.63
% 7.72/1.63 ------ Proving...
% 7.72/1.63
% 7.72/1.63
% 7.72/1.63 % SZS status Theorem for theBenchmark.p
% 7.72/1.63
% 7.72/1.63 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.72/1.63
% 7.72/1.64
%------------------------------------------------------------------------------