TSTP Solution File: SEU284+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU284+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n028.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 : Thu Aug 31 17:05:28 EDT 2023
% Result : Theorem 2.78s 1.15s
% Output : CNFRefutation 2.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 8
% Syntax : Number of formulae : 78 ( 8 unt; 0 def)
% Number of atoms : 287 ( 134 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 321 ( 112 ~; 118 |; 78 &)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 1 con; 0-2 aty)
% Number of variables : 127 ( 0 sgn; 69 !; 38 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,conjecture,
! [X0] :
? [X1] :
( ! [X2] :
( in(X2,X0)
=> apply(X1,X2) = singleton(X2) )
& relation_dom(X1) = X0
& function(X1)
& relation(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s3_funct_1__e16_22__wellord2) ).
fof(f2,negated_conjecture,
~ ! [X0] :
? [X1] :
( ! [X2] :
( in(X2,X0)
=> apply(X1,X2) = singleton(X2) )
& relation_dom(X1) = X0
& function(X1)
& relation(X1) ),
inference(negated_conjecture,[],[f1]) ).
fof(f8,axiom,
! [X0] :
( ( ! [X1] :
~ ( ! [X2] : singleton(X1) != X2
& in(X1,X0) )
& ! [X1,X2,X3] :
( ( singleton(X1) = X3
& singleton(X1) = X2
& in(X1,X0) )
=> X2 = X3 ) )
=> ? [X1] :
( ! [X2] :
( in(X2,X0)
=> apply(X1,X2) = singleton(X2) )
& relation_dom(X1) = X0
& function(X1)
& relation(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s2_funct_1__e16_22__wellord2__1) ).
fof(f29,plain,
! [X0] :
( ( ! [X1] :
~ ( ! [X2] : singleton(X1) != X2
& in(X1,X0) )
& ! [X3,X4,X5] :
( ( singleton(X3) = X5
& singleton(X3) = X4
& in(X3,X0) )
=> X4 = X5 ) )
=> ? [X6] :
( ! [X7] :
( in(X7,X0)
=> apply(X6,X7) = singleton(X7) )
& relation_dom(X6) = X0
& function(X6)
& relation(X6) ) ),
inference(rectify,[],[f8]) ).
fof(f32,plain,
? [X0] :
! [X1] :
( ? [X2] :
( apply(X1,X2) != singleton(X2)
& in(X2,X0) )
| relation_dom(X1) != X0
| ~ function(X1)
| ~ relation(X1) ),
inference(ennf_transformation,[],[f2]) ).
fof(f34,plain,
! [X0] :
( ? [X6] :
( ! [X7] :
( apply(X6,X7) = singleton(X7)
| ~ in(X7,X0) )
& relation_dom(X6) = X0
& function(X6)
& relation(X6) )
| ? [X1] :
( ! [X2] : singleton(X1) != X2
& in(X1,X0) )
| ? [X3,X4,X5] :
( X4 != X5
& singleton(X3) = X5
& singleton(X3) = X4
& in(X3,X0) ) ),
inference(ennf_transformation,[],[f29]) ).
fof(f35,plain,
! [X0] :
( ? [X6] :
( ! [X7] :
( apply(X6,X7) = singleton(X7)
| ~ in(X7,X0) )
& relation_dom(X6) = X0
& function(X6)
& relation(X6) )
| ? [X1] :
( ! [X2] : singleton(X1) != X2
& in(X1,X0) )
| ? [X3,X4,X5] :
( X4 != X5
& singleton(X3) = X5
& singleton(X3) = X4
& in(X3,X0) ) ),
inference(flattening,[],[f34]) ).
fof(f47,plain,
! [X0] :
( ? [X3,X4,X5] :
( X4 != X5
& singleton(X3) = X5
& singleton(X3) = X4
& in(X3,X0) )
| ~ sP0(X0) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f48,plain,
! [X0] :
( ? [X6] :
( ! [X7] :
( apply(X6,X7) = singleton(X7)
| ~ in(X7,X0) )
& relation_dom(X6) = X0
& function(X6)
& relation(X6) )
| ? [X1] :
( ! [X2] : singleton(X1) != X2
& in(X1,X0) )
| sP0(X0) ),
inference(definition_folding,[],[f35,f47]) ).
fof(f49,plain,
( ? [X0] :
! [X1] :
( ? [X2] :
( apply(X1,X2) != singleton(X2)
& in(X2,X0) )
| relation_dom(X1) != X0
| ~ function(X1)
| ~ relation(X1) )
=> ! [X1] :
( ? [X2] :
( apply(X1,X2) != singleton(X2)
& in(X2,sK1) )
| relation_dom(X1) != sK1
| ~ function(X1)
| ~ relation(X1) ) ),
introduced(choice_axiom,[]) ).
fof(f50,plain,
! [X1] :
( ? [X2] :
( apply(X1,X2) != singleton(X2)
& in(X2,sK1) )
=> ( apply(X1,sK2(X1)) != singleton(sK2(X1))
& in(sK2(X1),sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f51,plain,
! [X1] :
( ( apply(X1,sK2(X1)) != singleton(sK2(X1))
& in(sK2(X1),sK1) )
| relation_dom(X1) != sK1
| ~ function(X1)
| ~ relation(X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f32,f50,f49]) ).
fof(f54,plain,
! [X0] :
( ? [X3,X4,X5] :
( X4 != X5
& singleton(X3) = X5
& singleton(X3) = X4
& in(X3,X0) )
| ~ sP0(X0) ),
inference(nnf_transformation,[],[f47]) ).
fof(f55,plain,
! [X0] :
( ? [X1,X2,X3] :
( X2 != X3
& singleton(X1) = X3
& singleton(X1) = X2
& in(X1,X0) )
| ~ sP0(X0) ),
inference(rectify,[],[f54]) ).
fof(f56,plain,
! [X0] :
( ? [X1,X2,X3] :
( X2 != X3
& singleton(X1) = X3
& singleton(X1) = X2
& in(X1,X0) )
=> ( sK5(X0) != sK6(X0)
& sK6(X0) = singleton(sK4(X0))
& sK5(X0) = singleton(sK4(X0))
& in(sK4(X0),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f57,plain,
! [X0] :
( ( sK5(X0) != sK6(X0)
& sK6(X0) = singleton(sK4(X0))
& sK5(X0) = singleton(sK4(X0))
& in(sK4(X0),X0) )
| ~ sP0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6])],[f55,f56]) ).
fof(f58,plain,
! [X0] :
( ? [X1] :
( ! [X2] :
( apply(X1,X2) = singleton(X2)
| ~ in(X2,X0) )
& relation_dom(X1) = X0
& function(X1)
& relation(X1) )
| ? [X3] :
( ! [X4] : singleton(X3) != X4
& in(X3,X0) )
| sP0(X0) ),
inference(rectify,[],[f48]) ).
fof(f59,plain,
! [X0] :
( ? [X1] :
( ! [X2] :
( apply(X1,X2) = singleton(X2)
| ~ in(X2,X0) )
& relation_dom(X1) = X0
& function(X1)
& relation(X1) )
=> ( ! [X2] :
( singleton(X2) = apply(sK7(X0),X2)
| ~ in(X2,X0) )
& relation_dom(sK7(X0)) = X0
& function(sK7(X0))
& relation(sK7(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f60,plain,
! [X0] :
( ? [X3] :
( ! [X4] : singleton(X3) != X4
& in(X3,X0) )
=> ( ! [X4] : singleton(sK8(X0)) != X4
& in(sK8(X0),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f61,plain,
! [X0] :
( ( ! [X2] :
( singleton(X2) = apply(sK7(X0),X2)
| ~ in(X2,X0) )
& relation_dom(sK7(X0)) = X0
& function(sK7(X0))
& relation(sK7(X0)) )
| ( ! [X4] : singleton(sK8(X0)) != X4
& in(sK8(X0),X0) )
| sP0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8])],[f58,f60,f59]) ).
fof(f74,plain,
! [X1] :
( in(sK2(X1),sK1)
| relation_dom(X1) != sK1
| ~ function(X1)
| ~ relation(X1) ),
inference(cnf_transformation,[],[f51]) ).
fof(f75,plain,
! [X1] :
( apply(X1,sK2(X1)) != singleton(sK2(X1))
| relation_dom(X1) != sK1
| ~ function(X1)
| ~ relation(X1) ),
inference(cnf_transformation,[],[f51]) ).
fof(f80,plain,
! [X0] :
( sK5(X0) = singleton(sK4(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f81,plain,
! [X0] :
( sK6(X0) = singleton(sK4(X0))
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f82,plain,
! [X0] :
( sK5(X0) != sK6(X0)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f84,plain,
! [X0,X4] :
( relation(sK7(X0))
| singleton(sK8(X0)) != X4
| sP0(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f86,plain,
! [X0,X4] :
( function(sK7(X0))
| singleton(sK8(X0)) != X4
| sP0(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f87,plain,
! [X0] :
( relation_dom(sK7(X0)) = X0
| in(sK8(X0),X0)
| sP0(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f88,plain,
! [X0,X4] :
( relation_dom(sK7(X0)) = X0
| singleton(sK8(X0)) != X4
| sP0(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f90,plain,
! [X2,X0,X4] :
( singleton(X2) = apply(sK7(X0),X2)
| ~ in(X2,X0)
| singleton(sK8(X0)) != X4
| sP0(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f114,plain,
! [X2,X0] :
( singleton(X2) = apply(sK7(X0),X2)
| ~ in(X2,X0)
| sP0(X0) ),
inference(equality_resolution,[],[f90]) ).
fof(f115,plain,
! [X0] :
( relation_dom(sK7(X0)) = X0
| sP0(X0) ),
inference(equality_resolution,[],[f88]) ).
fof(f116,plain,
! [X0] :
( function(sK7(X0))
| sP0(X0) ),
inference(equality_resolution,[],[f86]) ).
fof(f117,plain,
! [X0] :
( relation(sK7(X0))
| sP0(X0) ),
inference(equality_resolution,[],[f84]) ).
cnf(c_49,negated_conjecture,
( apply(X0,sK2(X0)) != singleton(sK2(X0))
| relation_dom(X0) != sK1
| ~ function(X0)
| ~ relation(X0) ),
inference(cnf_transformation,[],[f75]) ).
cnf(c_50,negated_conjecture,
( relation_dom(X0) != sK1
| ~ function(X0)
| ~ relation(X0)
| in(sK2(X0),sK1) ),
inference(cnf_transformation,[],[f74]) ).
cnf(c_54,plain,
( sK5(X0) != sK6(X0)
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f82]) ).
cnf(c_55,plain,
( ~ sP0(X0)
| singleton(sK4(X0)) = sK6(X0) ),
inference(cnf_transformation,[],[f81]) ).
cnf(c_56,plain,
( ~ sP0(X0)
| singleton(sK4(X0)) = sK5(X0) ),
inference(cnf_transformation,[],[f80]) ).
cnf(c_58,plain,
( ~ in(X0,X1)
| apply(sK7(X1),X0) = singleton(X0)
| sP0(X1) ),
inference(cnf_transformation,[],[f114]) ).
cnf(c_60,plain,
( relation_dom(sK7(X0)) = X0
| sP0(X0) ),
inference(cnf_transformation,[],[f115]) ).
cnf(c_61,plain,
( relation_dom(sK7(X0)) = X0
| in(sK8(X0),X0)
| sP0(X0) ),
inference(cnf_transformation,[],[f87]) ).
cnf(c_62,plain,
( function(sK7(X0))
| sP0(X0) ),
inference(cnf_transformation,[],[f116]) ).
cnf(c_64,plain,
( relation(sK7(X0))
| sP0(X0) ),
inference(cnf_transformation,[],[f117]) ).
cnf(c_110,plain,
( relation_dom(sK7(X0)) = X0
| sP0(X0) ),
inference(global_subsumption_just,[status(thm)],[c_61,c_60]) ).
cnf(c_554,plain,
( sK5(X0) != sK6(X0)
| X0 != X1
| relation_dom(sK7(X1)) = X1 ),
inference(resolution_lifted,[status(thm)],[c_110,c_54]) ).
cnf(c_555,plain,
( sK5(X0) != sK6(X0)
| relation_dom(sK7(X0)) = X0 ),
inference(unflattening,[status(thm)],[c_554]) ).
cnf(c_2231,plain,
( singleton(sK4(X0)) = sK6(X0)
| relation_dom(sK7(X0)) = X0 ),
inference(superposition,[status(thm)],[c_60,c_55]) ).
cnf(c_2238,plain,
( singleton(sK4(X0)) = sK5(X0)
| relation_dom(sK7(X0)) = X0 ),
inference(superposition,[status(thm)],[c_60,c_56]) ).
cnf(c_2354,plain,
( relation_dom(sK7(X0)) = X0
| sK5(X0) = sK6(X0) ),
inference(superposition,[status(thm)],[c_2231,c_2238]) ).
cnf(c_2381,plain,
relation_dom(sK7(X0)) = X0,
inference(global_subsumption_just,[status(thm)],[c_2354,c_555,c_2354]) ).
cnf(c_2393,plain,
( X0 != sK1
| ~ function(sK7(X0))
| ~ relation(sK7(X0))
| in(sK2(sK7(X0)),sK1) ),
inference(superposition,[status(thm)],[c_2381,c_50]) ).
cnf(c_2431,plain,
( ~ function(sK7(sK1))
| ~ relation(sK7(sK1))
| in(sK2(sK7(sK1)),sK1) ),
inference(equality_resolution,[status(thm)],[c_2393]) ).
cnf(c_2441,plain,
( ~ function(sK7(sK1))
| ~ relation(sK7(sK1))
| apply(sK7(sK1),sK2(sK7(sK1))) = singleton(sK2(sK7(sK1)))
| sP0(sK1) ),
inference(superposition,[status(thm)],[c_2431,c_58]) ).
cnf(c_2474,plain,
( apply(sK7(sK1),sK2(sK7(sK1))) = singleton(sK2(sK7(sK1)))
| sP0(sK1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2441,c_64,c_62]) ).
cnf(c_2477,plain,
( apply(sK7(sK1),sK2(sK7(sK1))) = singleton(sK2(sK7(sK1)))
| singleton(sK4(sK1)) = sK5(sK1) ),
inference(superposition,[status(thm)],[c_2474,c_56]) ).
cnf(c_2478,plain,
( apply(sK7(sK1),sK2(sK7(sK1))) = singleton(sK2(sK7(sK1)))
| singleton(sK4(sK1)) = sK6(sK1) ),
inference(superposition,[status(thm)],[c_2474,c_55]) ).
cnf(c_2494,plain,
( relation_dom(sK7(sK1)) != sK1
| ~ function(sK7(sK1))
| ~ relation(sK7(sK1))
| singleton(sK4(sK1)) = sK5(sK1) ),
inference(superposition,[status(thm)],[c_2477,c_49]) ).
cnf(c_2495,plain,
( ~ function(sK7(sK1))
| ~ relation(sK7(sK1))
| singleton(sK4(sK1)) = sK5(sK1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2494,c_2381]) ).
cnf(c_2503,plain,
( relation_dom(sK7(sK1)) != sK1
| ~ function(sK7(sK1))
| ~ relation(sK7(sK1))
| singleton(sK4(sK1)) = sK6(sK1) ),
inference(superposition,[status(thm)],[c_2478,c_49]) ).
cnf(c_2504,plain,
( ~ function(sK7(sK1))
| ~ relation(sK7(sK1))
| singleton(sK4(sK1)) = sK6(sK1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2503,c_2381]) ).
cnf(c_2556,plain,
( relation_dom(sK7(sK1)) = sK1
| sP0(sK1) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_2557,plain,
( apply(sK7(sK1),sK2(sK7(sK1))) != singleton(sK2(sK7(sK1)))
| relation_dom(sK7(sK1)) != sK1
| ~ function(sK7(sK1))
| ~ relation(sK7(sK1)) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_2651,plain,
( ~ relation(sK7(sK1))
| singleton(sK4(sK1)) = sK5(sK1)
| sP0(sK1) ),
inference(superposition,[status(thm)],[c_62,c_2495]) ).
cnf(c_2662,plain,
( ~ relation(sK7(sK1))
| singleton(sK4(sK1)) = sK6(sK1)
| sP0(sK1) ),
inference(superposition,[status(thm)],[c_62,c_2504]) ).
cnf(c_2669,plain,
singleton(sK4(sK1)) = sK5(sK1),
inference(forward_subsumption_resolution,[status(thm)],[c_2651,c_56,c_64]) ).
cnf(c_2679,plain,
( ~ relation(sK7(sK1))
| sK5(sK1) = sK6(sK1)
| sP0(sK1) ),
inference(light_normalisation,[status(thm)],[c_2662,c_2669]) ).
cnf(c_2683,plain,
( sK5(sK1) = sK6(sK1)
| sP0(sK1) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2679,c_64]) ).
cnf(c_2687,plain,
( singleton(sK4(sK1)) = sK6(sK1)
| sK5(sK1) = sK6(sK1) ),
inference(superposition,[status(thm)],[c_2683,c_55]) ).
cnf(c_2689,plain,
sK5(sK1) = sK6(sK1),
inference(light_normalisation,[status(thm)],[c_2687,c_2669]) ).
cnf(c_2692,plain,
~ sP0(sK1),
inference(superposition,[status(thm)],[c_2689,c_54]) ).
cnf(c_2693,plain,
apply(sK7(sK1),sK2(sK7(sK1))) = singleton(sK2(sK7(sK1))),
inference(backward_subsumption_resolution,[status(thm)],[c_2474,c_2692]) ).
cnf(c_2696,plain,
( relation_dom(sK7(sK1)) != sK1
| ~ function(sK7(sK1))
| ~ relation(sK7(sK1)) ),
inference(superposition,[status(thm)],[c_2693,c_49]) ).
cnf(c_2697,plain,
( ~ function(sK7(sK1))
| ~ relation(sK7(sK1)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2696,c_2381]) ).
cnf(c_2703,plain,
( function(sK7(sK1))
| sP0(sK1) ),
inference(instantiation,[status(thm)],[c_62]) ).
cnf(c_2704,plain,
~ relation(sK7(sK1)),
inference(global_subsumption_just,[status(thm)],[c_2697,c_2556,c_2557,c_2692,c_2693,c_2703]) ).
cnf(c_2707,plain,
sP0(sK1),
inference(superposition,[status(thm)],[c_64,c_2704]) ).
cnf(c_2708,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2707,c_2692]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU284+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Aug 23 20:29:04 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.78/1.15 % SZS status Started for theBenchmark.p
% 2.78/1.15 % SZS status Theorem for theBenchmark.p
% 2.78/1.15
% 2.78/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.78/1.15
% 2.78/1.15 ------ iProver source info
% 2.78/1.15
% 2.78/1.15 git: date: 2023-05-31 18:12:56 +0000
% 2.78/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.78/1.15 git: non_committed_changes: false
% 2.78/1.15 git: last_make_outside_of_git: false
% 2.78/1.15
% 2.78/1.15 ------ Parsing...
% 2.78/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.78/1.15
% 2.78/1.15 ------ 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
% 2.78/1.15
% 2.78/1.15 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.78/1.15
% 2.78/1.15 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.78/1.15 ------ Proving...
% 2.78/1.15 ------ Problem Properties
% 2.78/1.15
% 2.78/1.15
% 2.78/1.15 clauses 31
% 2.78/1.15 conjectures 2
% 2.78/1.15 EPR 17
% 2.78/1.15 Horn 26
% 2.78/1.15 unary 11
% 2.78/1.15 binary 15
% 2.78/1.15 lits 58
% 2.78/1.15 lits eq 10
% 2.78/1.15 fd_pure 0
% 2.78/1.15 fd_pseudo 0
% 2.78/1.15 fd_cond 1
% 2.78/1.15 fd_pseudo_cond 1
% 2.78/1.15 AC symbols 0
% 2.78/1.15
% 2.78/1.15 ------ Schedule dynamic 5 is on
% 2.78/1.15
% 2.78/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.78/1.15
% 2.78/1.15
% 2.78/1.15 ------
% 2.78/1.15 Current options:
% 2.78/1.15 ------
% 2.78/1.15
% 2.78/1.15
% 2.78/1.15
% 2.78/1.15
% 2.78/1.15 ------ Proving...
% 2.78/1.15
% 2.78/1.15
% 2.78/1.15 % SZS status Theorem for theBenchmark.p
% 2.78/1.15
% 2.78/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.78/1.15
% 2.78/1.15
%------------------------------------------------------------------------------