TSTP Solution File: NUN076+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUN076+1 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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 02:53:17 EDT 2024
% Result : Theorem 8.18s 1.64s
% Output : CNFRefutation 8.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 21
% Syntax : Number of formulae : 87 ( 24 unt; 0 def)
% Number of atoms : 288 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 320 ( 119 ~; 91 |; 99 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 1 con; 0-2 aty)
% Number of variables : 233 ( 8 sgn 90 !; 70 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0] :
! [X1] :
( ( ~ id(X1,X0)
& ~ r1(X1) )
| ( r1(X1)
& id(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(f2,axiom,
! [X2] :
? [X3] :
! [X4] :
( ( ~ id(X4,X3)
& ~ r2(X2,X4) )
| ( r2(X2,X4)
& id(X4,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f5,axiom,
! [X13] : id(X13,X13),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(f6,axiom,
! [X14,X15] :
( id(X15,X14)
| ~ id(X14,X15) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(f7,axiom,
! [X16,X17,X18] :
( ~ id(X17,X18)
| id(X16,X18)
| ~ id(X16,X17) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(f8,axiom,
! [X19,X20] :
( ( r1(X20)
& r1(X19) )
| ( ~ r1(X20)
& ~ r1(X19) )
| ~ id(X19,X20) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).
fof(f12,axiom,
! [X37,X38] :
? [X39] :
( ? [X42] :
( r3(X37,X38,X42)
& r2(X42,X39) )
& ? [X40] :
( ? [X41] :
( r3(X37,X41,X40)
& r2(X38,X41) )
& id(X40,X39) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1a) ).
fof(f15,axiom,
! [X53] :
? [X54] :
( ? [X55] :
( r3(X53,X55,X54)
& r1(X55) )
& id(X54,X53) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4a) ).
fof(f16,axiom,
! [X56] :
? [X57] :
( ? [X59] :
( r1(X59)
& id(X57,X59) )
& ? [X58] :
( r4(X56,X58,X57)
& r1(X58) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5a) ).
fof(f19,conjecture,
? [X62,X45,X46] :
( ? [X40] :
( r3(X45,X46,X40)
& id(X40,X62) )
& ? [X39] :
( ? [X48] :
( ? [X42] :
( ? [X57] :
( r2(X57,X42)
& r1(X57) )
& r2(X42,X48) )
& r4(X48,X45,X39) )
& id(X39,X62) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thereexistsanevennumberid) ).
fof(f20,negated_conjecture,
~ ? [X62,X45,X46] :
( ? [X40] :
( r3(X45,X46,X40)
& id(X40,X62) )
& ? [X39] :
( ? [X48] :
( ? [X42] :
( ? [X57] :
( r2(X57,X42)
& r1(X57) )
& r2(X42,X48) )
& r4(X48,X45,X39) )
& id(X39,X62) ) ),
inference(negated_conjecture,[],[f19]) ).
fof(f21,plain,
! [X0] :
? [X1] :
! [X2] :
( ( ~ id(X2,X1)
& ~ r2(X0,X2) )
| ( r2(X0,X2)
& id(X2,X1) ) ),
inference(rectify,[],[f2]) ).
fof(f24,plain,
! [X0] : id(X0,X0),
inference(rectify,[],[f5]) ).
fof(f25,plain,
! [X0,X1] :
( id(X1,X0)
| ~ id(X0,X1) ),
inference(rectify,[],[f6]) ).
fof(f26,plain,
! [X0,X1,X2] :
( ~ id(X1,X2)
| id(X0,X2)
| ~ id(X0,X1) ),
inference(rectify,[],[f7]) ).
fof(f27,plain,
! [X0,X1] :
( ( r1(X1)
& r1(X0) )
| ( ~ r1(X1)
& ~ r1(X0) )
| ~ id(X0,X1) ),
inference(rectify,[],[f8]) ).
fof(f31,plain,
! [X0,X1] :
? [X2] :
( ? [X3] :
( r3(X0,X1,X3)
& r2(X3,X2) )
& ? [X4] :
( ? [X5] :
( r3(X0,X5,X4)
& r2(X1,X5) )
& id(X4,X2) ) ),
inference(rectify,[],[f12]) ).
fof(f34,plain,
! [X0] :
? [X1] :
( ? [X2] :
( r3(X0,X2,X1)
& r1(X2) )
& id(X1,X0) ),
inference(rectify,[],[f15]) ).
fof(f35,plain,
! [X0] :
? [X1] :
( ? [X2] :
( r1(X2)
& id(X1,X2) )
& ? [X3] :
( r4(X0,X3,X1)
& r1(X3) ) ),
inference(rectify,[],[f16]) ).
fof(f38,plain,
~ ? [X0,X1,X2] :
( ? [X3] :
( r3(X1,X2,X3)
& id(X3,X0) )
& ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( r2(X7,X6)
& r1(X7) )
& r2(X6,X5) )
& r4(X5,X1,X4) )
& id(X4,X0) ) ),
inference(rectify,[],[f20]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ! [X3] :
( ~ r3(X1,X2,X3)
| ~ id(X3,X0) )
| ! [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ~ r2(X7,X6)
| ~ r1(X7) )
| ~ r2(X6,X5) )
| ~ r4(X5,X1,X4) )
| ~ id(X4,X0) ) ),
inference(ennf_transformation,[],[f38]) ).
fof(f40,plain,
( ? [X0] :
! [X1] :
( ( ~ id(X1,X0)
& ~ r1(X1) )
| ( r1(X1)
& id(X1,X0) ) )
=> ! [X1] :
( ( ~ id(X1,sK0)
& ~ r1(X1) )
| ( r1(X1)
& id(X1,sK0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f41,plain,
! [X1] :
( ( ~ id(X1,sK0)
& ~ r1(X1) )
| ( r1(X1)
& id(X1,sK0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f1,f40]) ).
fof(f42,plain,
! [X0] :
( ? [X1] :
! [X2] :
( ( ~ id(X2,X1)
& ~ r2(X0,X2) )
| ( r2(X0,X2)
& id(X2,X1) ) )
=> ! [X2] :
( ( ~ id(X2,sK1(X0))
& ~ r2(X0,X2) )
| ( r2(X0,X2)
& id(X2,sK1(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f43,plain,
! [X0,X2] :
( ( ~ id(X2,sK1(X0))
& ~ r2(X0,X2) )
| ( r2(X0,X2)
& id(X2,sK1(X0)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f21,f42]) ).
fof(f48,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( r3(X0,X1,X3)
& r2(X3,X2) )
& ? [X4] :
( ? [X5] :
( r3(X0,X5,X4)
& r2(X1,X5) )
& id(X4,X2) ) )
=> ( ? [X3] :
( r3(X0,X1,X3)
& r2(X3,sK4(X0,X1)) )
& ? [X4] :
( ? [X5] :
( r3(X0,X5,X4)
& r2(X1,X5) )
& id(X4,sK4(X0,X1)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f49,plain,
! [X0,X1] :
( ? [X3] :
( r3(X0,X1,X3)
& r2(X3,sK4(X0,X1)) )
=> ( r3(X0,X1,sK5(X0,X1))
& r2(sK5(X0,X1),sK4(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f50,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( r3(X0,X5,X4)
& r2(X1,X5) )
& id(X4,sK4(X0,X1)) )
=> ( ? [X5] :
( r3(X0,X5,sK6(X0,X1))
& r2(X1,X5) )
& id(sK6(X0,X1),sK4(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f51,plain,
! [X0,X1] :
( ? [X5] :
( r3(X0,X5,sK6(X0,X1))
& r2(X1,X5) )
=> ( r3(X0,sK7(X0,X1),sK6(X0,X1))
& r2(X1,sK7(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f52,plain,
! [X0,X1] :
( r3(X0,X1,sK5(X0,X1))
& r2(sK5(X0,X1),sK4(X0,X1))
& r3(X0,sK7(X0,X1),sK6(X0,X1))
& r2(X1,sK7(X0,X1))
& id(sK6(X0,X1),sK4(X0,X1)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7])],[f31,f51,f50,f49,f48]) ).
fof(f58,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( r3(X0,X2,X1)
& r1(X2) )
& id(X1,X0) )
=> ( ? [X2] :
( r3(X0,X2,sK12(X0))
& r1(X2) )
& id(sK12(X0),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f59,plain,
! [X0] :
( ? [X2] :
( r3(X0,X2,sK12(X0))
& r1(X2) )
=> ( r3(X0,sK13(X0),sK12(X0))
& r1(sK13(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f60,plain,
! [X0] :
( r3(X0,sK13(X0),sK12(X0))
& r1(sK13(X0))
& id(sK12(X0),X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12,sK13])],[f34,f59,f58]) ).
fof(f61,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( r1(X2)
& id(X1,X2) )
& ? [X3] :
( r4(X0,X3,X1)
& r1(X3) ) )
=> ( ? [X2] :
( r1(X2)
& id(sK14(X0),X2) )
& ? [X3] :
( r4(X0,X3,sK14(X0))
& r1(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f62,plain,
! [X0] :
( ? [X2] :
( r1(X2)
& id(sK14(X0),X2) )
=> ( r1(sK15(X0))
& id(sK14(X0),sK15(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f63,plain,
! [X0] :
( ? [X3] :
( r4(X0,X3,sK14(X0))
& r1(X3) )
=> ( r4(X0,sK16(X0),sK14(X0))
& r1(sK16(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f64,plain,
! [X0] :
( r1(sK15(X0))
& id(sK14(X0),sK15(X0))
& r4(X0,sK16(X0),sK14(X0))
& r1(sK16(X0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK14,sK15,sK16])],[f35,f63,f62,f61]) ).
fof(f68,plain,
! [X1] :
( ~ r1(X1)
| id(X1,sK0) ),
inference(cnf_transformation,[],[f41]) ).
fof(f71,plain,
! [X1] :
( ~ id(X1,sK0)
| r1(X1) ),
inference(cnf_transformation,[],[f41]) ).
fof(f75,plain,
! [X2,X0] :
( ~ id(X2,sK1(X0))
| r2(X0,X2) ),
inference(cnf_transformation,[],[f43]) ).
fof(f84,plain,
! [X0] : id(X0,X0),
inference(cnf_transformation,[],[f24]) ).
fof(f85,plain,
! [X0,X1] :
( id(X1,X0)
| ~ id(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f86,plain,
! [X2,X0,X1] :
( ~ id(X1,X2)
| id(X0,X2)
| ~ id(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f89,plain,
! [X0,X1] :
( r1(X1)
| ~ r1(X0)
| ~ id(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f104,plain,
! [X0,X1] : r2(X1,sK7(X0,X1)),
inference(cnf_transformation,[],[f52]) ).
fof(f114,plain,
! [X0] : id(sK12(X0),X0),
inference(cnf_transformation,[],[f60]) ).
fof(f116,plain,
! [X0] : r3(X0,sK13(X0),sK12(X0)),
inference(cnf_transformation,[],[f60]) ).
fof(f117,plain,
! [X0] : r1(sK16(X0)),
inference(cnf_transformation,[],[f64]) ).
fof(f118,plain,
! [X0] : r4(X0,sK16(X0),sK14(X0)),
inference(cnf_transformation,[],[f64]) ).
fof(f119,plain,
! [X0] : id(sK14(X0),sK15(X0)),
inference(cnf_transformation,[],[f64]) ).
fof(f120,plain,
! [X0] : r1(sK15(X0)),
inference(cnf_transformation,[],[f64]) ).
fof(f126,plain,
! [X2,X3,X0,X1,X6,X7,X4,X5] :
( ~ r3(X1,X2,X3)
| ~ id(X3,X0)
| ~ r2(X7,X6)
| ~ r1(X7)
| ~ r2(X6,X5)
| ~ r4(X5,X1,X4)
| ~ id(X4,X0) ),
inference(cnf_transformation,[],[f39]) ).
cnf(c_49,plain,
( ~ id(X0,sK0)
| r1(X0) ),
inference(cnf_transformation,[],[f71]) ).
cnf(c_50,plain,
( ~ r1(X0)
| id(X0,sK0) ),
inference(cnf_transformation,[],[f68]) ).
cnf(c_51,plain,
( ~ id(X0,sK1(X1))
| r2(X1,X0) ),
inference(cnf_transformation,[],[f75]) ).
cnf(c_57,plain,
id(X0,X0),
inference(cnf_transformation,[],[f84]) ).
cnf(c_58,plain,
( ~ id(X0,X1)
| id(X1,X0) ),
inference(cnf_transformation,[],[f85]) ).
cnf(c_59,plain,
( ~ id(X0,X1)
| ~ id(X2,X0)
| id(X2,X1) ),
inference(cnf_transformation,[],[f86]) ).
cnf(c_60,plain,
( ~ id(X0,X1)
| ~ r1(X0)
| r1(X1) ),
inference(cnf_transformation,[],[f89]) ).
cnf(c_71,plain,
r2(X0,sK7(X1,X0)),
inference(cnf_transformation,[],[f104]) ).
cnf(c_79,plain,
r3(X0,sK13(X0),sK12(X0)),
inference(cnf_transformation,[],[f116]) ).
cnf(c_81,plain,
id(sK12(X0),X0),
inference(cnf_transformation,[],[f114]) ).
cnf(c_82,plain,
r1(sK15(X0)),
inference(cnf_transformation,[],[f120]) ).
cnf(c_83,plain,
id(sK14(X0),sK15(X0)),
inference(cnf_transformation,[],[f119]) ).
cnf(c_84,plain,
r4(X0,sK16(X0),sK14(X0)),
inference(cnf_transformation,[],[f118]) ).
cnf(c_85,plain,
r1(sK16(X0)),
inference(cnf_transformation,[],[f117]) ).
cnf(c_91,negated_conjecture,
( ~ r3(X0,X1,X2)
| ~ r4(X3,X0,X4)
| ~ id(X2,X5)
| ~ id(X4,X5)
| ~ r2(X6,X7)
| ~ r2(X7,X3)
| ~ r1(X6) ),
inference(cnf_transformation,[],[f126]) ).
cnf(c_95,plain,
id(sK0,sK0),
inference(instantiation,[status(thm)],[c_57]) ).
cnf(c_104,plain,
( ~ id(sK0,sK0)
| r1(sK0) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_666,plain,
( ~ r4(X0,X1,X2)
| ~ id(sK12(X1),X3)
| ~ id(X2,X3)
| ~ r2(X4,X5)
| ~ r2(X5,X0)
| ~ r1(X4) ),
inference(superposition,[status(thm)],[c_79,c_91]) ).
cnf(c_753,plain,
( ~ id(sK12(sK16(X0)),X1)
| ~ id(sK14(X0),X1)
| ~ r2(X2,X3)
| ~ r2(X3,X0)
| ~ r1(X2) ),
inference(superposition,[status(thm)],[c_84,c_666]) ).
cnf(c_851,plain,
( ~ id(sK14(X0),sK16(X0))
| ~ r2(X1,X2)
| ~ r2(X2,X0)
| ~ r1(X1) ),
inference(superposition,[status(thm)],[c_81,c_753]) ).
cnf(c_948,plain,
r2(X0,sK1(X0)),
inference(superposition,[status(thm)],[c_57,c_51]) ).
cnf(c_1318,plain,
id(sK15(X0),sK14(X0)),
inference(superposition,[status(thm)],[c_83,c_58]) ).
cnf(c_1765,plain,
( ~ r1(sK15(X0))
| r1(sK14(X0)) ),
inference(superposition,[status(thm)],[c_1318,c_60]) ).
cnf(c_2019,plain,
( ~ r1(sK16(X0))
| id(sK16(X0),sK0) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_4625,plain,
( ~ r4(X0,X1,X2)
| ~ id(sK12(X1),X3)
| ~ id(X2,X3)
| ~ r2(X4,X5)
| ~ r2(X5,X0)
| ~ r1(X4) ),
inference(superposition,[status(thm)],[c_79,c_91]) ).
cnf(c_4638,plain,
( ~ id(sK12(sK16(X0)),X1)
| ~ id(sK14(X0),X1)
| ~ r2(X2,X3)
| ~ r2(X3,X0)
| ~ r1(X2) ),
inference(superposition,[status(thm)],[c_84,c_4625]) ).
cnf(c_4888,plain,
( ~ id(X0,X1)
| id(sK12(X0),X1) ),
inference(superposition,[status(thm)],[c_81,c_59]) ).
cnf(c_4918,plain,
( ~ id(sK14(X0),X1)
| ~ id(sK16(X0),X1)
| ~ r2(X2,X3)
| ~ r2(X3,X0)
| ~ r1(X2) ),
inference(superposition,[status(thm)],[c_4888,c_4638]) ).
cnf(c_5933,plain,
( ~ id(sK16(X0),sK0)
| ~ r2(X1,X2)
| ~ r2(X2,X0)
| ~ r1(sK14(X0))
| ~ r1(X1) ),
inference(superposition,[status(thm)],[c_50,c_4918]) ).
cnf(c_9782,plain,
( ~ r2(X1,X2)
| ~ r2(X2,X0)
| ~ r1(X1) ),
inference(global_subsumption_just,[status(thm)],[c_851,c_85,c_82,c_1765,c_2019,c_5933]) ).
cnf(c_9783,plain,
( ~ r2(X0,X1)
| ~ r2(X1,X2)
| ~ r1(X0) ),
inference(renaming,[status(thm)],[c_9782]) ).
cnf(c_9826,plain,
( ~ r2(sK1(X0),X1)
| ~ r1(X0) ),
inference(superposition,[status(thm)],[c_948,c_9783]) ).
cnf(c_9837,plain,
~ r1(X0),
inference(superposition,[status(thm)],[c_71,c_9826]) ).
cnf(c_9841,plain,
~ r1(sK0),
inference(instantiation,[status(thm)],[c_9837]) ).
cnf(c_9842,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_9841,c_104,c_95]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : NUN076+1 : TPTP v8.1.2. Released v7.3.0.
% 0.07/0.12 % Command : run_iprover %s %d THM
% 0.11/0.33 % Computer : n012.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 21:36:40 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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
% 8.18/1.64 % SZS status Started for theBenchmark.p
% 8.18/1.64 % SZS status Theorem for theBenchmark.p
% 8.18/1.64
% 8.18/1.64 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 8.18/1.64
% 8.18/1.64 ------ iProver source info
% 8.18/1.64
% 8.18/1.64 git: date: 2024-05-02 19:28:25 +0000
% 8.18/1.64 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 8.18/1.64 git: non_committed_changes: false
% 8.18/1.64
% 8.18/1.64 ------ Parsing...
% 8.18/1.64 ------ Clausification by vclausify_rel & Parsing by iProver...
% 8.18/1.64
% 8.18/1.64 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e
% 8.18/1.64
% 8.18/1.64 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 8.18/1.64 ------ Proving...
% 8.18/1.64 ------ Problem Properties
% 8.18/1.64
% 8.18/1.64
% 8.18/1.64 clauses 43
% 8.18/1.64 conjectures 1
% 8.18/1.64 EPR 16
% 8.18/1.64 Horn 39
% 8.18/1.64 unary 18
% 8.18/1.64 binary 13
% 8.18/1.64 lits 95
% 8.18/1.64 lits eq 0
% 8.18/1.64 fd_pure 0
% 8.18/1.64 fd_pseudo 0
% 8.18/1.64 fd_cond 0
% 8.18/1.64 fd_pseudo_cond 0
% 8.18/1.64 AC symbols 0
% 8.18/1.64
% 8.18/1.64 ------ Input Options Time Limit: Unbounded
% 8.18/1.64
% 8.18/1.64
% 8.18/1.64 ------
% 8.18/1.64 Current options:
% 8.18/1.64 ------
% 8.18/1.64
% 8.18/1.64
% 8.18/1.64
% 8.18/1.64
% 8.18/1.64 ------ Proving...
% 8.18/1.64
% 8.18/1.64
% 8.18/1.64 % SZS status Theorem for theBenchmark.p
% 8.18/1.64
% 8.18/1.64 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 8.18/1.64
% 8.18/1.65
%------------------------------------------------------------------------------