TSTP Solution File: NUN065+2 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NUN065+2 : TPTP v8.2.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.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 : Mon Jun 24 13:30:48 EDT 2024
% Result : Theorem 3.95s 1.17s
% Output : CNFRefutation 3.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 17
% Syntax : Number of formulae : 95 ( 23 unt; 0 def)
% Number of atoms : 262 ( 103 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 253 ( 86 ~; 84 |; 73 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 1 con; 0-2 aty)
% Number of variables : 202 ( 9 sgn 104 !; 39 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
? [X0] :
! [X1] :
( ( X0 = X1
& r1(X1) )
| ( X0 != X1
& ~ r1(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(f2,axiom,
! [X2] :
? [X3] :
! [X4] :
( ( X3 = X4
& r2(X2,X4) )
| ( X3 != X4
& ~ r2(X2,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f3,axiom,
! [X5,X6] :
? [X7] :
! [X8] :
( ( X7 = X8
& r3(X5,X6,X8) )
| ( X7 != X8
& ~ r3(X5,X6,X8) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f5,axiom,
! [X13,X14] :
? [X15] :
( ? [X18] :
( r3(X13,X14,X18)
& r2(X18,X15) )
& ? [X16] :
( X15 = X16
& ? [X17] :
( r3(X13,X17,X16)
& r2(X14,X17) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1a) ).
fof(f7,axiom,
! [X25,X26] :
( X25 = X26
| ! [X27] :
( ~ r2(X26,X27)
| ! [X28] :
( X27 != X28
| ~ r2(X25,X28) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3a) ).
fof(f11,axiom,
! [X40,X41] :
( ~ r2(X40,X41)
| ! [X42] :
( X41 != X42
| ~ r1(X42) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7a) ).
fof(f12,conjecture,
? [X38] :
( ! [X15] :
( X15 != X38
| ~ r1(X15) )
& ! [X21] :
( X21 != X38
| ! [X22] :
( ~ r2(X22,X21)
| ~ r1(X22) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nononesexist) ).
fof(f13,negated_conjecture,
~ ? [X38] :
( ! [X15] :
( X15 != X38
| ~ r1(X15) )
& ! [X21] :
( X21 != X38
| ! [X22] :
( ~ r2(X22,X21)
| ~ r1(X22) ) ) ),
inference(negated_conjecture,[],[f12]) ).
fof(f14,plain,
! [X0] :
? [X1] :
! [X2] :
( ( X1 = X2
& r2(X0,X2) )
| ( X1 != X2
& ~ r2(X0,X2) ) ),
inference(rectify,[],[f2]) ).
fof(f15,plain,
! [X0,X1] :
? [X2] :
! [X3] :
( ( X2 = X3
& r3(X0,X1,X3) )
| ( X2 != X3
& ~ r3(X0,X1,X3) ) ),
inference(rectify,[],[f3]) ).
fof(f17,plain,
! [X0,X1] :
? [X2] :
( ? [X3] :
( r3(X0,X1,X3)
& r2(X3,X2) )
& ? [X4] :
( X2 = X4
& ? [X5] :
( r3(X0,X5,X4)
& r2(X1,X5) ) ) ),
inference(rectify,[],[f5]) ).
fof(f19,plain,
! [X0,X1] :
( X0 = X1
| ! [X2] :
( ~ r2(X1,X2)
| ! [X3] :
( X2 != X3
| ~ r2(X0,X3) ) ) ),
inference(rectify,[],[f7]) ).
fof(f23,plain,
! [X0,X1] :
( ~ r2(X0,X1)
| ! [X2] :
( X1 != X2
| ~ r1(X2) ) ),
inference(rectify,[],[f11]) ).
fof(f24,plain,
~ ? [X0] :
( ! [X1] :
( X0 != X1
| ~ r1(X1) )
& ! [X2] :
( X0 != X2
| ! [X3] :
( ~ r2(X3,X2)
| ~ r1(X3) ) ) ),
inference(rectify,[],[f13]) ).
fof(f25,plain,
! [X0] :
( ? [X1] :
( X0 = X1
& r1(X1) )
| ? [X2] :
( X0 = X2
& ? [X3] :
( r2(X3,X2)
& r1(X3) ) ) ),
inference(ennf_transformation,[],[f24]) ).
fof(f26,plain,
( ? [X0] :
! [X1] :
( ( X0 = X1
& r1(X1) )
| ( X0 != X1
& ~ r1(X1) ) )
=> ! [X1] :
( ( sK0 = X1
& r1(X1) )
| ( sK0 != X1
& ~ r1(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f27,plain,
! [X1] :
( ( sK0 = X1
& r1(X1) )
| ( sK0 != X1
& ~ r1(X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f1,f26]) ).
fof(f28,plain,
! [X0] :
( ? [X1] :
! [X2] :
( ( X1 = X2
& r2(X0,X2) )
| ( X1 != X2
& ~ r2(X0,X2) ) )
=> ! [X2] :
( ( sK1(X0) = X2
& r2(X0,X2) )
| ( sK1(X0) != X2
& ~ r2(X0,X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
! [X0,X2] :
( ( sK1(X0) = X2
& r2(X0,X2) )
| ( sK1(X0) != X2
& ~ r2(X0,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f14,f28]) ).
fof(f30,plain,
! [X0,X1] :
( ? [X2] :
! [X3] :
( ( X2 = X3
& r3(X0,X1,X3) )
| ( X2 != X3
& ~ r3(X0,X1,X3) ) )
=> ! [X3] :
( ( sK2(X0,X1) = X3
& r3(X0,X1,X3) )
| ( sK2(X0,X1) != X3
& ~ r3(X0,X1,X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
! [X0,X1,X3] :
( ( sK2(X0,X1) = X3
& r3(X0,X1,X3) )
| ( sK2(X0,X1) != X3
& ~ r3(X0,X1,X3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f15,f30]) ).
fof(f34,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( r3(X0,X1,X3)
& r2(X3,X2) )
& ? [X4] :
( X2 = X4
& ? [X5] :
( r3(X0,X5,X4)
& r2(X1,X5) ) ) )
=> ( ? [X3] :
( r3(X0,X1,X3)
& r2(X3,sK4(X0,X1)) )
& ? [X4] :
( sK4(X0,X1) = X4
& ? [X5] :
( r3(X0,X5,X4)
& r2(X1,X5) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f35,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(f36,plain,
! [X0,X1] :
( ? [X4] :
( sK4(X0,X1) = X4
& ? [X5] :
( r3(X0,X5,X4)
& r2(X1,X5) ) )
=> ( sK4(X0,X1) = sK6(X0,X1)
& ? [X5] :
( r3(X0,X5,sK6(X0,X1))
& r2(X1,X5) ) ) ),
introduced(choice_axiom,[]) ).
fof(f37,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(f38,plain,
! [X0,X1] :
( r3(X0,X1,sK5(X0,X1))
& r2(sK5(X0,X1),sK4(X0,X1))
& sK4(X0,X1) = sK6(X0,X1)
& r3(X0,sK7(X0,X1),sK6(X0,X1))
& r2(X1,sK7(X0,X1)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7])],[f17,f37,f36,f35,f34]) ).
fof(f54,plain,
! [X0] :
( ? [X1] :
( X0 = X1
& r1(X1) )
=> ( sK20(X0) = X0
& r1(sK20(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f55,plain,
! [X0] :
( ? [X2] :
( X0 = X2
& ? [X3] :
( r2(X3,X2)
& r1(X3) ) )
=> ( sK21(X0) = X0
& ? [X3] :
( r2(X3,sK21(X0))
& r1(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f56,plain,
! [X0] :
( ? [X3] :
( r2(X3,sK21(X0))
& r1(X3) )
=> ( r2(sK22(X0),sK21(X0))
& r1(sK22(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f57,plain,
! [X0] :
( ( sK20(X0) = X0
& r1(sK20(X0)) )
| ( sK21(X0) = X0
& r2(sK22(X0),sK21(X0))
& r1(sK22(X0)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK20,sK21,sK22])],[f25,f56,f55,f54]) ).
fof(f59,plain,
! [X1] :
( r1(X1)
| sK0 != X1 ),
inference(cnf_transformation,[],[f27]) ).
fof(f60,plain,
! [X1] :
( sK0 = X1
| ~ r1(X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f63,plain,
! [X2,X0] :
( r2(X0,X2)
| sK1(X0) != X2 ),
inference(cnf_transformation,[],[f29]) ).
fof(f64,plain,
! [X2,X0] :
( sK1(X0) = X2
| ~ r2(X0,X2) ),
inference(cnf_transformation,[],[f29]) ).
fof(f68,plain,
! [X3,X0,X1] :
( sK2(X0,X1) = X3
| ~ r3(X0,X1,X3) ),
inference(cnf_transformation,[],[f31]) ).
fof(f76,plain,
! [X0,X1] : sK4(X0,X1) = sK6(X0,X1),
inference(cnf_transformation,[],[f38]) ).
fof(f77,plain,
! [X0,X1] : r2(sK5(X0,X1),sK4(X0,X1)),
inference(cnf_transformation,[],[f38]) ).
fof(f78,plain,
! [X0,X1] : r3(X0,X1,sK5(X0,X1)),
inference(cnf_transformation,[],[f38]) ).
fof(f84,plain,
! [X2,X3,X0,X1] :
( X0 = X1
| ~ r2(X1,X2)
| X2 != X3
| ~ r2(X0,X3) ),
inference(cnf_transformation,[],[f19]) ).
fof(f96,plain,
! [X2,X0,X1] :
( ~ r2(X0,X1)
| X1 != X2
| ~ r1(X2) ),
inference(cnf_transformation,[],[f23]) ).
fof(f97,plain,
! [X0] :
( r1(sK20(X0))
| r1(sK22(X0)) ),
inference(cnf_transformation,[],[f57]) ).
fof(f98,plain,
! [X0] :
( r1(sK20(X0))
| r2(sK22(X0),sK21(X0)) ),
inference(cnf_transformation,[],[f57]) ).
fof(f99,plain,
! [X0] :
( r1(sK20(X0))
| sK21(X0) = X0 ),
inference(cnf_transformation,[],[f57]) ).
fof(f100,plain,
! [X0] :
( sK20(X0) = X0
| r1(sK22(X0)) ),
inference(cnf_transformation,[],[f57]) ).
fof(f101,plain,
! [X0] :
( sK20(X0) = X0
| r2(sK22(X0),sK21(X0)) ),
inference(cnf_transformation,[],[f57]) ).
fof(f102,plain,
! [X0] :
( sK20(X0) = X0
| sK21(X0) = X0 ),
inference(cnf_transformation,[],[f57]) ).
fof(f103,plain,
! [X0,X1] : r2(sK5(X0,X1),sK6(X0,X1)),
inference(definition_unfolding,[],[f77,f76]) ).
fof(f107,plain,
r1(sK0),
inference(equality_resolution,[],[f59]) ).
fof(f109,plain,
! [X0] : r2(X0,sK1(X0)),
inference(equality_resolution,[],[f63]) ).
fof(f114,plain,
! [X3,X0,X1] :
( X0 = X1
| ~ r2(X1,X3)
| ~ r2(X0,X3) ),
inference(equality_resolution,[],[f84]) ).
fof(f115,plain,
! [X2,X0] :
( ~ r2(X0,X2)
| ~ r1(X2) ),
inference(equality_resolution,[],[f96]) ).
cnf(c_49,plain,
( ~ r1(X0)
| X0 = sK0 ),
inference(cnf_transformation,[],[f60]) ).
cnf(c_50,plain,
r1(sK0),
inference(cnf_transformation,[],[f107]) ).
cnf(c_51,plain,
( ~ r2(X0,X1)
| sK1(X0) = X1 ),
inference(cnf_transformation,[],[f64]) ).
cnf(c_52,plain,
r2(X0,sK1(X0)),
inference(cnf_transformation,[],[f109]) ).
cnf(c_53,plain,
( ~ r3(X0,X1,X2)
| sK2(X0,X1) = X2 ),
inference(cnf_transformation,[],[f68]) ).
cnf(c_57,plain,
r3(X0,X1,sK5(X0,X1)),
inference(cnf_transformation,[],[f78]) ).
cnf(c_58,plain,
r2(sK5(X0,X1),sK6(X0,X1)),
inference(cnf_transformation,[],[f103]) ).
cnf(c_65,plain,
( ~ r2(X0,X1)
| ~ r2(X2,X1)
| X0 = X2 ),
inference(cnf_transformation,[],[f114]) ).
cnf(c_76,plain,
( ~ r2(X0,X1)
| ~ r1(X1) ),
inference(cnf_transformation,[],[f115]) ).
cnf(c_77,negated_conjecture,
( sK20(X0) = X0
| sK21(X0) = X0 ),
inference(cnf_transformation,[],[f102]) ).
cnf(c_78,negated_conjecture,
( sK20(X0) = X0
| r2(sK22(X0),sK21(X0)) ),
inference(cnf_transformation,[],[f101]) ).
cnf(c_79,negated_conjecture,
( sK20(X0) = X0
| r1(sK22(X0)) ),
inference(cnf_transformation,[],[f100]) ).
cnf(c_80,negated_conjecture,
( sK21(X0) = X0
| r1(sK20(X0)) ),
inference(cnf_transformation,[],[f99]) ).
cnf(c_81,negated_conjecture,
( r2(sK22(X0),sK21(X0))
| r1(sK20(X0)) ),
inference(cnf_transformation,[],[f98]) ).
cnf(c_82,negated_conjecture,
( r1(sK20(X0))
| r1(sK22(X0)) ),
inference(cnf_transformation,[],[f97]) ).
cnf(c_316,plain,
( sK5(X1,X3) != X4
| X0 != X1
| X2 != X3
| sK2(X0,X2) = X4 ),
inference(resolution_lifted,[status(thm)],[c_53,c_57]) ).
cnf(c_317,plain,
sK2(X0,X1) = sK5(X0,X1),
inference(unflattening,[status(thm)],[c_316]) ).
cnf(c_444,plain,
r2(sK2(X0,X1),sK6(X0,X1)),
inference(demodulation,[status(thm)],[c_58,c_317]) ).
cnf(c_501,negated_conjecture,
( r1(sK20(X0))
| r1(sK22(X0)) ),
inference(demodulation,[status(thm)],[c_82]) ).
cnf(c_502,negated_conjecture,
( r2(sK22(X0),sK21(X0))
| r1(sK20(X0)) ),
inference(demodulation,[status(thm)],[c_81]) ).
cnf(c_503,negated_conjecture,
( sK21(X0) = X0
| r1(sK20(X0)) ),
inference(demodulation,[status(thm)],[c_80]) ).
cnf(c_504,negated_conjecture,
( sK20(X0) = X0
| r1(sK22(X0)) ),
inference(demodulation,[status(thm)],[c_79]) ).
cnf(c_505,negated_conjecture,
( sK20(X0) = X0
| r2(sK22(X0),sK21(X0)) ),
inference(demodulation,[status(thm)],[c_78]) ).
cnf(c_506,negated_conjecture,
( sK20(X0) = X0
| sK21(X0) = X0 ),
inference(demodulation,[status(thm)],[c_77]) ).
cnf(c_786,plain,
( sK20(X0) = X0
| r2(sK22(X0),X0) ),
inference(superposition,[status(thm)],[c_506,c_505]) ).
cnf(c_804,plain,
( sK22(X0) = sK0
| r1(sK20(X0)) ),
inference(superposition,[status(thm)],[c_501,c_49]) ).
cnf(c_902,plain,
~ r1(sK1(X0)),
inference(superposition,[status(thm)],[c_52,c_76]) ).
cnf(c_1124,plain,
( ~ r2(X0,sK1(X1))
| X0 = X1 ),
inference(superposition,[status(thm)],[c_52,c_65]) ).
cnf(c_1186,plain,
sK1(sK2(X0,X1)) = sK6(X0,X1),
inference(superposition,[status(thm)],[c_444,c_51]) ).
cnf(c_1187,plain,
~ r1(sK6(X0,X1)),
inference(superposition,[status(thm)],[c_444,c_76]) ).
cnf(c_2226,plain,
( sK20(sK1(X0)) = sK1(X0)
| sK22(sK1(X0)) = X0 ),
inference(superposition,[status(thm)],[c_786,c_1124]) ).
cnf(c_3171,plain,
( sK20(sK1(X0)) = sK1(X0)
| r1(X0) ),
inference(superposition,[status(thm)],[c_2226,c_504]) ).
cnf(c_3428,plain,
sK20(sK1(sK1(X0))) = sK1(sK1(X0)),
inference(superposition,[status(thm)],[c_3171,c_902]) ).
cnf(c_3535,plain,
( sK22(sK1(sK1(X0))) = sK0
| r1(sK1(sK1(X0))) ),
inference(superposition,[status(thm)],[c_3428,c_804]) ).
cnf(c_3536,plain,
( sK21(sK1(sK1(X0))) = sK1(sK1(X0))
| r1(sK1(sK1(X0))) ),
inference(superposition,[status(thm)],[c_3428,c_503]) ).
cnf(c_3537,plain,
sK22(sK1(sK1(X0))) = sK0,
inference(forward_subsumption_resolution,[status(thm)],[c_3535,c_902]) ).
cnf(c_3539,plain,
sK21(sK1(sK1(X0))) = sK1(sK1(X0)),
inference(forward_subsumption_resolution,[status(thm)],[c_3536,c_902]) ).
cnf(c_3593,plain,
( r2(sK0,sK21(sK1(sK1(X0))))
| r1(sK20(sK1(sK1(X0)))) ),
inference(superposition,[status(thm)],[c_3537,c_502]) ).
cnf(c_3597,plain,
( r2(sK0,sK1(sK1(X0)))
| r1(sK1(sK1(X0))) ),
inference(light_normalisation,[status(thm)],[c_3593,c_3428,c_3539]) ).
cnf(c_3598,plain,
r2(sK0,sK1(sK1(X0))),
inference(forward_subsumption_resolution,[status(thm)],[c_3597,c_902]) ).
cnf(c_4558,plain,
sK1(X0) = sK0,
inference(superposition,[status(thm)],[c_3598,c_1124]) ).
cnf(c_4606,plain,
sK6(X0,X1) = sK0,
inference(demodulation,[status(thm)],[c_1186,c_4558]) ).
cnf(c_4634,plain,
~ r1(sK0),
inference(demodulation,[status(thm)],[c_1187,c_4606]) ).
cnf(c_4636,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_4634,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUN065+2 : TPTP v8.2.0. Released v7.3.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.12/0.32 % Computer : n007.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Tue Jun 18 21:18:39 EDT 2024
% 0.12/0.32 % 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
% 3.95/1.17 % SZS status Started for theBenchmark.p
% 3.95/1.17 % SZS status Theorem for theBenchmark.p
% 3.95/1.17
% 3.95/1.17 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.95/1.17
% 3.95/1.17 ------ iProver source info
% 3.95/1.17
% 3.95/1.17 git: date: 2024-06-12 09:56:46 +0000
% 3.95/1.17 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 3.95/1.17 git: non_committed_changes: false
% 3.95/1.17
% 3.95/1.17 ------ Parsing...
% 3.95/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.95/1.17
% 3.95/1.17 ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 2 sf_s rm: 3 0s sf_e pe_s pe_e
% 3.95/1.17
% 3.95/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.95/1.17
% 3.95/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.95/1.17 ------ Proving...
% 3.95/1.17 ------ Problem Properties
% 3.95/1.17
% 3.95/1.17
% 3.95/1.17 clauses 30
% 3.95/1.17 conjectures 6
% 3.95/1.17 EPR 4
% 3.95/1.17 Horn 20
% 3.95/1.17 unary 16
% 3.95/1.17 binary 13
% 3.95/1.17 lits 45
% 3.95/1.17 lits eq 20
% 3.95/1.17 fd_pure 0
% 3.95/1.17 fd_pseudo 0
% 3.95/1.17 fd_cond 1
% 3.95/1.17 fd_pseudo_cond 2
% 3.95/1.17 AC symbols 0
% 3.95/1.17
% 3.95/1.17 ------ Schedule dynamic 5 is on
% 3.95/1.17
% 3.95/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.95/1.17
% 3.95/1.17
% 3.95/1.17 ------
% 3.95/1.17 Current options:
% 3.95/1.17 ------
% 3.95/1.17
% 3.95/1.17
% 3.95/1.17
% 3.95/1.17
% 3.95/1.17 ------ Proving...
% 3.95/1.17
% 3.95/1.17
% 3.95/1.17 % SZS status Theorem for theBenchmark.p
% 3.95/1.17
% 3.95/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.95/1.17
% 3.95/1.17
%------------------------------------------------------------------------------