TSTP Solution File: SET169+4 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET169+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n003.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:00:10 EDT 2024
% Result : Theorem 88.39s 12.73s
% Output : CNFRefutation 88.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 67 ( 8 unt; 0 def)
% Number of atoms : 179 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 195 ( 83 ~; 81 |; 20 &)
% ( 7 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 118 ( 5 sgn 82 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_set) ).
fof(f4,axiom,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection) ).
fof(f5,axiom,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
<=> ( member(X2,X1)
| member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union) ).
fof(f12,conjecture,
! [X0,X1,X5] : equal_set(intersection(X0,union(X1,X5)),union(intersection(X0,X1),intersection(X0,X5))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI10) ).
fof(f13,negated_conjecture,
~ ! [X0,X1,X5] : equal_set(intersection(X0,union(X1,X5)),union(intersection(X0,X1),intersection(X0,X5))),
inference(negated_conjecture,[],[f12]) ).
fof(f15,plain,
! [X0,X1,X2] :
( member(X0,intersection(X1,X2))
<=> ( member(X0,X2)
& member(X0,X1) ) ),
inference(rectify,[],[f4]) ).
fof(f16,plain,
! [X0,X1,X2] :
( member(X0,union(X1,X2))
<=> ( member(X0,X2)
| member(X0,X1) ) ),
inference(rectify,[],[f5]) ).
fof(f23,plain,
~ ! [X0,X1,X2] : equal_set(intersection(X0,union(X1,X2)),union(intersection(X0,X1),intersection(X0,X2))),
inference(rectify,[],[f13]) ).
fof(f24,plain,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> equal_set(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f25,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f26,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f27,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(flattening,[],[f26]) ).
fof(f29,plain,
? [X0,X1,X2] : ~ equal_set(intersection(X0,union(X1,X2)),union(intersection(X0,X1),intersection(X0,X2))),
inference(ennf_transformation,[],[f23]) ).
fof(f30,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f25]) ).
fof(f31,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f30]) ).
fof(f32,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f31,f32]) ).
fof(f35,plain,
! [X0,X1,X2] :
( ( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) )
& ( ( member(X0,X2)
& member(X0,X1) )
| ~ member(X0,intersection(X1,X2)) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f36,plain,
! [X0,X1,X2] :
( ( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) )
& ( ( member(X0,X2)
& member(X0,X1) )
| ~ member(X0,intersection(X1,X2)) ) ),
inference(flattening,[],[f35]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ( member(X0,union(X1,X2))
| ( ~ member(X0,X2)
& ~ member(X0,X1) ) )
& ( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X1,X2)) ) ),
inference(nnf_transformation,[],[f16]) ).
fof(f38,plain,
! [X0,X1,X2] :
( ( member(X0,union(X1,X2))
| ( ~ member(X0,X2)
& ~ member(X0,X1) ) )
& ( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X1,X2)) ) ),
inference(flattening,[],[f37]) ).
fof(f52,plain,
( ? [X0,X1,X2] : ~ equal_set(intersection(X0,union(X1,X2)),union(intersection(X0,X1),intersection(X0,X2)))
=> ~ equal_set(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))) ),
introduced(choice_axiom,[]) ).
fof(f53,plain,
~ equal_set(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f29,f52]) ).
fof(f55,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f33]) ).
fof(f56,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f33]) ).
fof(f57,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f60,plain,
! [X2,X0,X1] :
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f36]) ).
fof(f61,plain,
! [X2,X0,X1] :
( member(X0,X2)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f36]) ).
fof(f62,plain,
! [X2,X0,X1] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X2)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f36]) ).
fof(f63,plain,
! [X2,X0,X1] :
( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f38]) ).
fof(f64,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f38]) ).
fof(f65,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f38]) ).
fof(f81,plain,
~ equal_set(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))),
inference(cnf_transformation,[],[f53]) ).
cnf(c_49,plain,
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
cnf(c_50,plain,
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f55]) ).
cnf(c_52,plain,
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| equal_set(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
cnf(c_55,plain,
( ~ member(X0,X1)
| ~ member(X0,X2)
| member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f62]) ).
cnf(c_56,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
inference(cnf_transformation,[],[f61]) ).
cnf(c_57,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f60]) ).
cnf(c_58,plain,
( ~ member(X0,X1)
| member(X0,union(X2,X1)) ),
inference(cnf_transformation,[],[f65]) ).
cnf(c_59,plain,
( ~ member(X0,X1)
| member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f64]) ).
cnf(c_60,plain,
( ~ member(X0,union(X1,X2))
| member(X0,X1)
| member(X0,X2) ),
inference(cnf_transformation,[],[f63]) ).
cnf(c_76,negated_conjecture,
~ equal_set(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))),
inference(cnf_transformation,[],[f81]) ).
cnf(c_281,plain,
( union(intersection(sK3,sK4),intersection(sK3,sK5)) != X1
| intersection(sK3,union(sK4,sK5)) != X0
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(resolution_lifted,[status(thm)],[c_52,c_76]) ).
cnf(c_282,plain,
( ~ subset(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5)))
| ~ subset(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))) ),
inference(unflattening,[status(thm)],[c_281]) ).
cnf(c_933,plain,
( ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))),union(intersection(sK3,sK4),intersection(sK3,sK5)))
| subset(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_934,plain,
( member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))),intersection(sK3,union(sK4,sK5)))
| subset(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_1008,plain,
( member(sK0(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5))),union(intersection(sK3,sK4),intersection(sK3,sK5)))
| subset(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5))) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_1009,plain,
( ~ member(sK0(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5))),intersection(sK3,union(sK4,sK5)))
| subset(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5))) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_1032,plain,
( ~ member(sK0(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5))),union(intersection(sK3,sK4),intersection(sK3,sK5)))
| member(sK0(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5))),intersection(sK3,sK4))
| member(sK0(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5))),intersection(sK3,sK5)) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_1064,plain,
( ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))),intersection(sK3,union(sK4,sK5)))
| member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))),sK3) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_1065,plain,
( ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))),intersection(sK3,union(sK4,sK5)))
| member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))),union(sK4,sK5)) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_2341,plain,
( ~ member(sK0(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5))),intersection(sK3,sK4))
| member(sK0(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5))),sK3) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_2342,plain,
( ~ member(sK0(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5))),intersection(sK3,sK4))
| member(sK0(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5))),sK4) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_2617,plain,
( ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))),intersection(sK3,sK5))
| member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))),union(intersection(sK3,sK4),intersection(sK3,sK5))) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_2619,plain,
( ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))),intersection(sK3,sK4))
| member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))),union(intersection(sK3,sK4),intersection(sK3,sK5))) ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_2686,plain,
( ~ member(sK0(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5))),union(sK4,sK5))
| ~ member(sK0(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5))),sK3)
| member(sK0(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5))),intersection(sK3,union(sK4,sK5))) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_8460,plain,
( ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))),sK3)
| ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))),sK5)
| member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))),intersection(sK3,sK5)) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_8701,plain,
( ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))),sK3)
| ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))),sK4)
| member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))),intersection(sK3,sK4)) ),
inference(instantiation,[status(thm)],[c_55]) ).
cnf(c_11044,plain,
( ~ member(sK0(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5))),sK4)
| member(sK0(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5))),union(sK4,sK5)) ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_205009,plain,
( ~ member(sK0(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5))),intersection(sK3,sK5))
| member(sK0(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5))),sK3) ),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_205010,plain,
( ~ member(sK0(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5))),intersection(sK3,sK5))
| member(sK0(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5))),sK5) ),
inference(instantiation,[status(thm)],[c_56]) ).
cnf(c_213645,plain,
( ~ member(sK0(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5))),sK5)
| member(sK0(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5))),union(X0,sK5)) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_222796,plain,
( ~ member(sK0(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5))),sK5)
| member(sK0(union(intersection(sK3,sK4),intersection(sK3,sK5)),intersection(sK3,union(sK4,sK5))),union(sK4,sK5)) ),
inference(instantiation,[status(thm)],[c_213645]) ).
cnf(c_240887,plain,
( ~ member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))),union(sK4,sK5))
| member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))),sK4)
| member(sK0(intersection(sK3,union(sK4,sK5)),union(intersection(sK3,sK4),intersection(sK3,sK5))),sK5) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_249423,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_240887,c_222796,c_205009,c_205010,c_11044,c_8701,c_8460,c_2686,c_2619,c_2617,c_2341,c_2342,c_1064,c_1065,c_1032,c_1008,c_1009,c_934,c_933,c_282]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET169+4 : TPTP v8.1.2. Released v2.2.0.
% 0.06/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n003.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu May 2 20:25:50 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.18/0.45 Running first-order theorem proving
% 0.18/0.45 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
% 88.39/12.73 % SZS status Started for theBenchmark.p
% 88.39/12.73 % SZS status Theorem for theBenchmark.p
% 88.39/12.73
% 88.39/12.73 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 88.39/12.73
% 88.39/12.73 ------ iProver source info
% 88.39/12.73
% 88.39/12.73 git: date: 2024-05-02 19:28:25 +0000
% 88.39/12.73 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 88.39/12.73 git: non_committed_changes: false
% 88.39/12.73
% 88.39/12.73 ------ Parsing...
% 88.39/12.73 ------ Clausification by vclausify_rel & Parsing by iProver...
% 88.39/12.73
% 88.39/12.73 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e
% 88.39/12.73
% 88.39/12.73 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 88.39/12.73
% 88.39/12.73 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 88.39/12.73 ------ Proving...
% 88.39/12.73 ------ Problem Properties
% 88.39/12.73
% 88.39/12.73
% 88.39/12.73 clauses 27
% 88.39/12.73 conjectures 0
% 88.39/12.73 EPR 2
% 88.39/12.73 Horn 22
% 88.39/12.73 unary 4
% 88.39/12.73 binary 16
% 88.39/12.73 lits 57
% 88.39/12.73 lits eq 3
% 88.39/12.73 fd_pure 0
% 88.39/12.73 fd_pseudo 0
% 88.39/12.73 fd_cond 0
% 88.39/12.73 fd_pseudo_cond 2
% 88.39/12.73 AC symbols 0
% 88.39/12.73
% 88.39/12.73 ------ Input Options Time Limit: Unbounded
% 88.39/12.73
% 88.39/12.73
% 88.39/12.73 ------
% 88.39/12.73 Current options:
% 88.39/12.73 ------
% 88.39/12.73
% 88.39/12.73
% 88.39/12.73
% 88.39/12.73
% 88.39/12.73 ------ Proving...
% 88.39/12.73
% 88.39/12.73
% 88.39/12.73 % SZS status Theorem for theBenchmark.p
% 88.39/12.73
% 88.39/12.73 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 88.39/12.73
% 88.39/12.74
%------------------------------------------------------------------------------