%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SET597+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 02:47:30 PM UTC 2026
% Result : Theorem 0.90s 1.29s
% Output : CNFRefutation 0.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 7
% Syntax : Number of formulae : 81 ( 16 unt; 1 def)
% Number of atoms : 323 ( 54 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 318 ( 126 ~; 139 |; 42 &)
% ( 5 <=>; 4 =>; 0 <=; 2 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 108 ( 0 sgn 88 !; 20 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : subset(X0,union(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_of_union) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( subset(X2,X1)
& subset(X0,X1) )
=> subset(union(X0,X2),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_subset) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f5,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(f6,axiom,
! [X0,X1] : union(X0,X1) = union(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_union) ).
fof(f9,conjecture,
! [X0,X1,X2] :
( X0 = union(X1,X2)
<=> ( ! [X3] :
( ( subset(X2,X3)
& subset(X1,X3) )
=> subset(X0,X3) )
& subset(X2,X0)
& subset(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th56) ).
fof(f10,negated_conjecture,
~ ! [X0,X1,X2] :
( X0 = union(X1,X2)
<=> ( ! [X3] :
( ( subset(X2,X3)
& subset(X1,X3) )
=> subset(X0,X3) )
& subset(X2,X0)
& subset(X1,X0) ) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f11,plain,
! [X0,X1,X2] :
( ~ subset(X2,X1)
| ~ subset(X0,X1)
| subset(union(X0,X2),X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f12,plain,
! [X0,X1,X2] :
( ~ subset(X2,X1)
| ~ subset(X0,X1)
| subset(union(X0,X2),X1) ),
inference(flattening,[],[f11]) ).
fof(f13,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f14,plain,
? [X0,X1,X2] :
( X0 = union(X1,X2)
<~> ( ! [X3] :
( ~ subset(X2,X3)
| ~ subset(X1,X3)
| subset(X0,X3) )
& subset(X2,X0)
& subset(X1,X0) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f15,plain,
? [X0,X1,X2] :
( X0 = union(X1,X2)
<~> ( ! [X3] :
( ~ subset(X2,X3)
| ~ subset(X1,X3)
| subset(X0,X3) )
& subset(X2,X0)
& subset(X1,X0) ) ),
inference(flattening,[],[f14]) ).
fof(f18,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X2] :
( ~ member(X2,X0)
| member(X2,X1) ) )
& ( ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) )
| subset(X0,X1) ) ),
inference(nnf_transformation,[],[f13]) ).
fof(f19,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ member(X3,X0)
| member(X3,X1) ) )
& ( ? [X2] :
( member(X2,X0)
& ~ member(X2,X1) )
| subset(X0,X1) ) ),
inference(rectify,[],[f18]) ).
fof(f20,plain,
! [X0,X1] :
( ( ~ subset(X0,X1)
| ! [X3] :
( ~ member(X3,X0)
| member(X3,X1) ) )
& ( ( member(sK0(X0,X1),X0)
& ~ member(sK0(X0,X1),X1) )
| subset(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f19]) ).
fof(f21,plain,
! [X0,X1] :
( ( X0 != X1
| ( subset(X1,X0)
& subset(X0,X1) ) )
& ( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f22,plain,
! [X0,X1] :
( ( X0 != X1
| ( subset(X1,X0)
& subset(X0,X1) ) )
& ( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ) ),
inference(flattening,[],[f21]) ).
fof(f26,plain,
? [X0,X1,X2] :
( ( X0 = union(X1,X2)
| ( ! [X3] :
( ~ subset(X2,X3)
| ~ subset(X1,X3)
| subset(X0,X3) )
& subset(X2,X0)
& subset(X1,X0) ) )
& ( union(X1,X2) != X0
| ? [X3] :
( subset(X2,X3)
& subset(X1,X3)
& ~ subset(X0,X3) )
| ~ subset(X2,X0)
| ~ subset(X1,X0) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f27,plain,
? [X0,X1,X2] :
( ( X0 = union(X1,X2)
| ( ! [X3] :
( ~ subset(X2,X3)
| ~ subset(X1,X3)
| subset(X0,X3) )
& subset(X2,X0)
& subset(X1,X0) ) )
& ( union(X1,X2) != X0
| ? [X3] :
( subset(X2,X3)
& subset(X1,X3)
& ~ subset(X0,X3) )
| ~ subset(X2,X0)
| ~ subset(X1,X0) ) ),
inference(flattening,[],[f26]) ).
fof(f28,plain,
? [X0,X1,X2] :
( ( X0 = union(X1,X2)
| ( ! [X4] :
( ~ subset(X2,X4)
| ~ subset(X1,X4)
| subset(X0,X4) )
& subset(X2,X0)
& subset(X1,X0) ) )
& ( union(X1,X2) != X0
| ? [X3] :
( subset(X2,X3)
& subset(X1,X3)
& ~ subset(X0,X3) )
| ~ subset(X2,X0)
| ~ subset(X1,X0) ) ),
inference(rectify,[],[f27]) ).
fof(f29,plain,
( ( sK2 = union(sK3,sK4)
| ( ! [X4] :
( ~ subset(sK4,X4)
| ~ subset(sK3,X4)
| subset(sK2,X4) )
& subset(sK4,sK2)
& subset(sK3,sK2) ) )
& ( sK2 != union(sK3,sK4)
| ( subset(sK4,sK5)
& subset(sK3,sK5)
& ~ subset(sK2,sK5) )
| ~ subset(sK4,sK2)
| ~ subset(sK3,sK2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4),skolemize(X3,sK5)],[f28]) ).
fof(f30,plain,
! [X0,X1] : subset(X0,union(X0,X1)),
inference(cnf_transformation,[],[f1]) ).
fof(f31,plain,
! [X2,X0,X1] :
( ~ subset(X2,X1)
| ~ subset(X0,X1)
| subset(union(X0,X2),X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f35,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X3,X0)
| member(X3,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f36,plain,
! [X0,X1] :
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f37,plain,
! [X0,X1] :
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f20]) ).
fof(f40,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f22]) ).
fof(f41,plain,
! [X0,X1] : union(X0,X1) = union(X1,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f47,plain,
! [X4] :
( sK2 = union(sK3,sK4)
| ~ subset(sK4,X4)
| ~ subset(sK3,X4)
| subset(sK2,X4) ),
inference(cnf_transformation,[],[f29]) ).
fof(f48,plain,
( sK2 = union(sK3,sK4)
| subset(sK4,sK2) ),
inference(cnf_transformation,[],[f29]) ).
fof(f49,plain,
( sK2 = union(sK3,sK4)
| subset(sK3,sK2) ),
inference(cnf_transformation,[],[f29]) ).
fof(f50,plain,
( sK2 != union(sK3,sK4)
| subset(sK4,sK5)
| ~ subset(sK4,sK2)
| ~ subset(sK3,sK2) ),
inference(cnf_transformation,[],[f29]) ).
fof(f51,plain,
( sK2 != union(sK3,sK4)
| subset(sK3,sK5)
| ~ subset(sK4,sK2)
| ~ subset(sK3,sK2) ),
inference(cnf_transformation,[],[f29]) ).
fof(f52,plain,
( sK2 != union(sK3,sK4)
| ~ subset(sK2,sK5)
| ~ subset(sK4,sK2)
| ~ subset(sK3,sK2) ),
inference(cnf_transformation,[],[f29]) ).
tcf(c_49,plain,
! [X0: $i,X1: $i] : subset(X0,union(X0,X1)),
inference(cnf_transformation,[],[f30]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(union(X0,X2),X1)
| ~ subset(X2,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f37]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f36]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f40]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] : union(X0,X1) = union(X1,X0),
inference(cnf_transformation,[],[f41]) ).
tcf(c_64,negated_conjecture,
( ~ subset(sK4,sK2)
| ~ subset(sK2,sK5)
| ~ subset(sK3,sK2)
| ( union(sK3,sK4) != sK2 ) ),
inference(cnf_transformation,[],[f52]) ).
tcf(c_65,negated_conjecture,
( subset(sK3,sK5)
| ~ subset(sK4,sK2)
| ~ subset(sK3,sK2)
| ( union(sK3,sK4) != sK2 ) ),
inference(cnf_transformation,[],[f51]) ).
tcf(c_66,negated_conjecture,
( subset(sK4,sK5)
| ~ subset(sK4,sK2)
| ~ subset(sK3,sK2)
| ( union(sK3,sK4) != sK2 ) ),
inference(cnf_transformation,[],[f50]) ).
tcf(c_67,negated_conjecture,
( subset(sK3,sK2)
| ( union(sK3,sK4) = sK2 ) ),
inference(cnf_transformation,[],[f49]) ).
tcf(c_68,negated_conjecture,
( subset(sK4,sK2)
| ( union(sK3,sK4) = sK2 ) ),
inference(cnf_transformation,[],[f48]) ).
tcf(c_69,negated_conjecture,
! [X0: $i] :
( subset(sK2,X0)
| ( union(sK3,sK4) = sK2 )
| ~ subset(sK4,X0)
| ~ subset(sK3,X0) ),
inference(cnf_transformation,[],[f47]) ).
tcf(c_467,definition,
iPr_def_10 = union(sK3,sK4),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_468,negated_conjecture,
! [X0: $i] :
( subset(sK2,X0)
| ( iPr_def_10 = sK2 )
| ~ subset(sK4,X0)
| ~ subset(sK3,X0) ),
inference(demodulation,[status(thm)],[c_69,c_467]) ).
tcf(c_469,negated_conjecture,
( subset(sK4,sK2)
| ( iPr_def_10 = sK2 ) ),
inference(demodulation,[status(thm)],[c_68]) ).
tcf(c_470,negated_conjecture,
( subset(sK3,sK2)
| ( iPr_def_10 = sK2 ) ),
inference(demodulation,[status(thm)],[c_67]) ).
tcf(c_471,negated_conjecture,
( subset(sK4,sK5)
| ~ subset(sK4,sK2)
| ~ subset(sK3,sK2)
| ( iPr_def_10 != sK2 ) ),
inference(demodulation,[status(thm)],[c_66]) ).
tcf(c_472,negated_conjecture,
( subset(sK3,sK5)
| ~ subset(sK4,sK2)
| ~ subset(sK3,sK2)
| ( iPr_def_10 != sK2 ) ),
inference(demodulation,[status(thm)],[c_65]) ).
tcf(c_473,negated_conjecture,
( ~ subset(sK4,sK2)
| ~ subset(sK2,sK5)
| ~ subset(sK3,sK2)
| ( iPr_def_10 != sK2 ) ),
inference(demodulation,[status(thm)],[c_64]) ).
tcf(c_792,plain,
subset(sK3,iPr_def_10),
inference(superposition,[status(thm)],[c_467,c_49]) ).
tcf(c_802,plain,
! [X0: $i,X1: $i] : subset(X0,union(X1,X0)),
inference(superposition,[status(thm)],[c_60,c_49]) ).
tcf(c_816,plain,
subset(sK4,iPr_def_10),
inference(superposition,[status(thm)],[c_467,c_802]) ).
tcf(c_822,plain,
( subset(sK2,iPr_def_10)
| ( sK2 = iPr_def_10 )
| ~ subset(sK3,iPr_def_10) ),
inference(superposition,[status(thm)],[c_816,c_468]) ).
tcf(c_823,plain,
( subset(sK2,iPr_def_10)
| ( sK2 = iPr_def_10 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_822,c_792]) ).
tcf(c_909,plain,
! [X0: $i] :
( subset(iPr_def_10,X0)
| ~ subset(sK4,X0)
| ~ subset(sK3,X0) ),
inference(superposition,[status(thm)],[c_467,c_50]) ).
tcf(c_949,plain,
! [X0: $i] :
( member(X0,sK2)
| ( sK2 = iPr_def_10 )
| ~ member(X0,sK4) ),
inference(superposition,[status(thm)],[c_469,c_56]) ).
tcf(c_990,plain,
( subset(sK4,sK2)
| ~ member(sK0(sK4,sK2),sK2) ),
inference(instantiation,[status(thm)],[c_54]) ).
tcf(c_1036,plain,
( subset(iPr_def_10,sK2)
| ( sK2 = iPr_def_10 )
| ~ subset(sK4,sK2) ),
inference(superposition,[status(thm)],[c_470,c_909]) ).
tcf(c_1079,plain,
! [X0: $i] :
( subset(sK4,X0)
| member(sK0(sK4,X0),sK2)
| ( sK2 = iPr_def_10 ) ),
inference(superposition,[status(thm)],[c_55,c_949]) ).
tcf(c_1083,plain,
( subset(sK4,sK2)
| member(sK0(sK4,sK2),sK2)
| ( sK2 = iPr_def_10 ) ),
inference(instantiation,[status(thm)],[c_1079]) ).
tcf(c_1084,plain,
( subset(iPr_def_10,sK2)
| ( sK2 = iPr_def_10 ) ),
inference(global_subsumption_just,[status(thm)],[c_1036,c_990,c_1036,c_1083]) ).
tcf(c_1159,plain,
( ( sK2 = iPr_def_10 )
| ~ subset(iPr_def_10,sK2) ),
inference(superposition,[status(thm)],[c_823,c_57]) ).
tcf(c_1160,plain,
( ( sK2 = iPr_def_10 )
| ~ subset(sK2,iPr_def_10) ),
inference(superposition,[status(thm)],[c_1084,c_57]) ).
tcf(c_1354,plain,
sK2 = iPr_def_10,
inference(global_subsumption_just,[status(thm)],[c_1159,c_823,c_1160]) ).
tcf(c_1364,plain,
( ~ subset(iPr_def_10,sK5)
| ~ subset(sK4,iPr_def_10)
| ~ subset(sK3,iPr_def_10)
| ( iPr_def_10 != iPr_def_10 ) ),
inference(demodulation,[status(thm)],[c_473,c_1354]) ).
tcf(c_1365,plain,
( subset(sK3,sK5)
| ~ subset(sK4,iPr_def_10)
| ~ subset(sK3,iPr_def_10)
| ( iPr_def_10 != iPr_def_10 ) ),
inference(demodulation,[status(thm)],[c_472,c_1354]) ).
tcf(c_1366,plain,
( subset(sK4,sK5)
| ~ subset(sK4,iPr_def_10)
| ~ subset(sK3,iPr_def_10)
| ( iPr_def_10 != iPr_def_10 ) ),
inference(demodulation,[status(thm)],[c_471,c_1354]) ).
tcf(c_1370,plain,
( subset(sK4,sK5)
| ~ subset(sK4,iPr_def_10)
| ~ subset(sK3,iPr_def_10) ),
inference(equality_resolution_simp,[status(thm)],[c_1366]) ).
tcf(c_1371,plain,
subset(sK4,sK5),
inference(forward_subsumption_resolution,[status(thm)],[c_1370,c_816,c_792]) ).
tcf(c_1372,plain,
( subset(sK3,sK5)
| ~ subset(sK4,iPr_def_10)
| ~ subset(sK3,iPr_def_10) ),
inference(equality_resolution_simp,[status(thm)],[c_1365]) ).
tcf(c_1373,plain,
subset(sK3,sK5),
inference(forward_subsumption_resolution,[status(thm)],[c_1372,c_816,c_792]) ).
tcf(c_1374,plain,
( ~ subset(iPr_def_10,sK5)
| ~ subset(sK4,iPr_def_10)
| ~ subset(sK3,iPr_def_10) ),
inference(equality_resolution_simp,[status(thm)],[c_1364]) ).
tcf(c_1375,plain,
~ subset(iPr_def_10,sK5),
inference(forward_subsumption_resolution,[status(thm)],[c_1374,c_816,c_792]) ).
tcf(c_1395,plain,
( subset(iPr_def_10,sK5)
| ~ subset(sK4,sK5) ),
inference(superposition,[status(thm)],[c_1373,c_909]) ).
tcf(c_1396,plain,
subset(iPr_def_10,sK5),
inference(forward_subsumption_resolution,[status(thm)],[c_1395,c_1371]) ).
tcf(c_1401,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1396,c_1375]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET597+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.38 % Computer : n002.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 11:26:34 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.43
% 0.11/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43
% 0.11/0.43 % Detected problem language: tptp
% 0.11/0.44 % Proving...
% 0.90/1.29 % SZS status Started for theBenchmark.p
% 0.90/1.29 % SZS status Theorem for theBenchmark.p
% 0.90/1.29
% 0.90/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.90/1.29
% 0.90/1.29 % ------ iProver source info
% 0.90/1.29
% 0.90/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.90/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.90/1.29 % git: non_committed_changes: false
% 0.90/1.29
% 0.90/1.29 % ------ Parsing...
% 0.90/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.90/1.29
% 0.90/1.29 % ------ Preprocessing... sup_sim: 0 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 %
% 0.90/1.29
% 0.90/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.90/1.29
% 0.90/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.90/1.29 % ------ Proving...
% 0.90/1.29 % ------ Problem Properties
% 0.90/1.29
% 0.90/1.29 %
% 0.90/1.29 % clauses 20
% 0.90/1.29 % conjectures 6
% 0.90/1.29 % EPR 9
% 0.90/1.29 % Horn 14
% 0.90/1.29 % unary 4
% 0.90/1.29 % binary 6
% 0.90/1.29 % lits 50
% 0.90/1.29 % lits eq 11
% 0.90/1.29 % fd_pure 0
% 0.90/1.29 % fd_pseudo 0
% 0.90/1.29 % fd_cond 0
% 0.90/1.29 % fd_pseudo_cond 3
% 0.90/1.29 % AC symbols 0
% 0.90/1.29
% 0.90/1.29 % ------ Schedule dynamic 5 is on
% 0.90/1.29
% 0.90/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.90/1.29
% 0.90/1.29
% 0.90/1.29 % ------
% 0.90/1.29 % Current options:
% 0.90/1.29 % ------
% 0.90/1.29
% 0.90/1.29
% 0.90/1.29 %
% 0.90/1.29
% 0.90/1.29 % ------ Proving...
% 0.90/1.29 %
% 0.90/1.29
% 0.90/1.29 % SZS status Theorem for theBenchmark.p
% 0.90/1.29
% 0.90/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.90/1.29
% 0.90/1.29
%------------------------------------------------------------------------------