TSTP Solution File: SEU156+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SEU156+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% 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 : 300s
% DateTime : Fri May 3 03:04:44 EDT 2024
% Result : Theorem 10.33s 2.10s
% Output : CNFRefutation 10.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 11
% Syntax : Number of formulae : 80 ( 24 unt; 0 def)
% Number of atoms : 255 ( 204 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 273 ( 98 ~; 122 |; 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/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(f7,axiom,
! [X0,X1] :
( singleton(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> X0 = X2 ) ),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',t69_enumset1) ).
fof(f84,axiom,
! [X0,X1,X2] :
( singleton(X0) = unordered_pair(X1,X2)
=> X0 = X1 ),
file('/export/starexec/sandbox/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_2711,negated_conjecture,
( sK15 != sK17
| sK14 != sK16 ),
inference(demodulation,[status(thm)],[c_141]) ).
cnf(c_4581,plain,
( unordered_pair(X0,X1) != unordered_pair(X2,X3)
| X1 = X2
| X1 = X3 ),
inference(superposition,[status(thm)],[c_51,c_127]) ).
cnf(c_4584,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_4683,plain,
( unordered_pair(sK14,sK15) = unordered_pair(sK16,sK16)
| unordered_pair(sK14,sK14) = unordered_pair(sK16,sK16) ),
inference(equality_resolution,[status(thm)],[c_4584]) ).
cnf(c_4713,plain,
( unordered_pair(X0,X1) != unordered_pair(sK14,sK15)
| unordered_pair(sK14,sK14) = unordered_pair(sK16,sK16)
| X0 = sK16 ),
inference(superposition,[status(thm)],[c_4683,c_127]) ).
cnf(c_4853,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_4581]) ).
cnf(c_4969,plain,
( unordered_pair(sK14,sK15) = unordered_pair(sK16,sK17)
| unordered_pair(sK14,sK14) = unordered_pair(sK16,sK17) ),
inference(equality_resolution,[status(thm)],[c_4853]) ).
cnf(c_4978,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_4969,c_4581]) ).
cnf(c_4979,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_4969,c_127]) ).
cnf(c_4984,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_4969,c_4581]) ).
cnf(c_5545,plain,
( unordered_pair(sK14,sK14) = unordered_pair(sK16,sK16)
| sK14 = sK16 ),
inference(equality_resolution,[status(thm)],[c_4713]) ).
cnf(c_6296,plain,
( unordered_pair(sK14,sK14) = unordered_pair(sK16,sK17)
| sK15 = sK17
| sK17 = sK14 ),
inference(equality_resolution,[status(thm)],[c_4978]) ).
cnf(c_6340,plain,
( unordered_pair(sK14,sK14) = unordered_pair(sK16,sK17)
| sK15 = sK16
| sK14 = sK16 ),
inference(equality_resolution,[status(thm)],[c_4979]) ).
cnf(c_6392,plain,
( unordered_pair(sK14,sK14) = unordered_pair(sK16,sK17)
| sK15 = sK17
| sK15 = sK16 ),
inference(equality_resolution,[status(thm)],[c_4984]) ).
cnf(c_20596,plain,
sK14 = sK16,
inference(forward_subsumption_resolution,[status(thm)],[c_5545,c_167]) ).
cnf(c_20745,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_20596]) ).
cnf(c_20746,plain,
( sK15 != sK17
| sK14 != sK14 ),
inference(demodulation,[status(thm)],[c_2711,c_20596]) ).
cnf(c_20747,plain,
sK15 != sK17,
inference(equality_resolution_simp,[status(thm)],[c_20746]) ).
cnf(c_25682,plain,
( unordered_pair(sK14,sK14) = unordered_pair(sK16,sK17)
| sK17 = sK14 ),
inference(global_subsumption_just,[status(thm)],[c_6296,c_6296,c_20747]) ).
cnf(c_25684,plain,
( unordered_pair(sK14,sK17) = unordered_pair(sK14,sK14)
| sK17 = sK14 ),
inference(light_normalisation,[status(thm)],[c_25682,c_20596]) ).
cnf(c_25691,plain,
( sK17 = sK14
| in(sK17,unordered_pair(sK14,sK14)) ),
inference(superposition,[status(thm)],[c_25684,c_70]) ).
cnf(c_27145,plain,
( sK15 = sK16
| unordered_pair(sK14,sK14) = unordered_pair(sK16,sK17) ),
inference(global_subsumption_just,[status(thm)],[c_6340,c_6392,c_20747]) ).
cnf(c_27146,plain,
( unordered_pair(sK14,sK14) = unordered_pair(sK16,sK17)
| sK15 = sK16 ),
inference(renaming,[status(thm)],[c_27145]) ).
cnf(c_27147,plain,
( unordered_pair(sK14,sK17) = unordered_pair(sK14,sK14)
| sK15 = sK14 ),
inference(light_normalisation,[status(thm)],[c_27146,c_20596]) ).
cnf(c_27193,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_27147,c_20745]) ).
cnf(c_27816,plain,
( sK15 = sK14
| in(unordered_pair(sK14,sK15),unordered_pair(unordered_pair(sK14,sK14),unordered_pair(sK14,sK14))) ),
inference(superposition,[status(thm)],[c_27193,c_70]) ).
cnf(c_30078,plain,
sK17 = sK14,
inference(forward_subsumption_resolution,[status(thm)],[c_25691,c_60]) ).
cnf(c_30137,plain,
sK15 != sK14,
inference(demodulation,[status(thm)],[c_20747,c_30078]) ).
cnf(c_30193,plain,
in(unordered_pair(sK14,sK15),unordered_pair(unordered_pair(sK14,sK14),unordered_pair(sK14,sK14))),
inference(backward_subsumption_resolution,[status(thm)],[c_27816,c_30137]) ).
cnf(c_30292,plain,
unordered_pair(sK14,sK15) = unordered_pair(sK14,sK14),
inference(superposition,[status(thm)],[c_30193,c_60]) ).
cnf(c_30311,plain,
in(sK15,unordered_pair(sK14,sK14)),
inference(superposition,[status(thm)],[c_30292,c_70]) ).
cnf(c_30377,plain,
sK15 = sK14,
inference(superposition,[status(thm)],[c_30311,c_60]) ).
cnf(c_30379,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_30377,c_30137]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SEU156+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.10 % Command : run_iprover %s %d THM
% 0.10/0.31 % Computer : n027.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Thu May 2 18:05:50 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.17/0.41 Running first-order theorem proving
% 0.17/0.41 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 10.33/2.10 % SZS status Started for theBenchmark.p
% 10.33/2.10 % SZS status Theorem for theBenchmark.p
% 10.33/2.10
% 10.33/2.10 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 10.33/2.10
% 10.33/2.10 ------ iProver source info
% 10.33/2.10
% 10.33/2.10 git: date: 2024-05-02 19:28:25 +0000
% 10.33/2.10 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 10.33/2.10 git: non_committed_changes: false
% 10.33/2.10
% 10.33/2.10 ------ Parsing...
% 10.33/2.10 ------ Clausification by vclausify_rel & Parsing by iProver...
% 10.33/2.10
% 10.33/2.10 ------ 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
% 10.33/2.10
% 10.33/2.10 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 10.33/2.10
% 10.33/2.10 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 10.33/2.10 ------ Proving...
% 10.33/2.10 ------ Problem Properties
% 10.33/2.10
% 10.33/2.10
% 10.33/2.10 clauses 109
% 10.33/2.10 conjectures 1
% 10.33/2.10 EPR 22
% 10.33/2.10 Horn 84
% 10.33/2.10 unary 25
% 10.33/2.10 binary 46
% 10.33/2.10 lits 236
% 10.33/2.10 lits eq 70
% 10.33/2.10 fd_pure 0
% 10.33/2.10 fd_pseudo 0
% 10.33/2.10 fd_cond 3
% 10.33/2.10 fd_pseudo_cond 29
% 10.33/2.10 AC symbols 0
% 10.33/2.10
% 10.33/2.10 ------ Schedule dynamic 5 is on
% 10.33/2.10
% 10.33/2.10 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 10.33/2.10
% 10.33/2.10
% 10.33/2.10 ------
% 10.33/2.10 Current options:
% 10.33/2.10 ------
% 10.33/2.10
% 10.33/2.10
% 10.33/2.10
% 10.33/2.10
% 10.33/2.10 ------ Proving...
% 10.33/2.10
% 10.33/2.10
% 10.33/2.10 % SZS status Theorem for theBenchmark.p
% 10.33/2.10
% 10.33/2.10 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 10.33/2.10
% 10.33/2.10
%------------------------------------------------------------------------------