TSTP Solution File: SET014+4 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET014+4 : TPTP v8.2.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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 14:32:20 EDT 2024
% Result : Theorem 92.66s 13.28s
% Output : CNFRefutation 92.66s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset) ).
fof(f3,axiom,
! [X2,X0] :
( member(X2,power_set(X0))
<=> subset(X2,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',power_set) ).
fof(f5,axiom,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
<=> ( member(X2,X1)
| member(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union) ).
fof(f8,axiom,
! [X2,X0] :
( member(X2,singleton(X0))
<=> X0 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton) ).
fof(f12,conjecture,
! [X0,X2,X4] :
( ( subset(X4,X0)
& subset(X2,X0) )
<=> subset(union(X2,X4),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI45) ).
fof(f13,negated_conjecture,
~ ! [X0,X2,X4] :
( ( subset(X4,X0)
& subset(X2,X0) )
<=> subset(union(X2,X4),X0) ),
inference(negated_conjecture,[],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( member(X0,power_set(X1))
<=> subset(X0,X1) ),
inference(rectify,[],[f3]) ).
fof(f16,plain,
! [X0,X1,X2] :
( member(X0,union(X1,X2))
<=> ( member(X0,X2)
| member(X0,X1) ) ),
inference(rectify,[],[f5]) ).
fof(f19,plain,
! [X0,X1] :
( member(X0,singleton(X1))
<=> X0 = X1 ),
inference(rectify,[],[f8]) ).
fof(f23,plain,
~ ! [X0,X1,X2] :
( ( subset(X2,X0)
& subset(X1,X0) )
<=> subset(union(X1,X2),X0) ),
inference(rectify,[],[f13]) ).
fof(f24,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f26,plain,
? [X0,X1,X2] :
( ( subset(X2,X0)
& subset(X1,X0) )
<~> subset(union(X1,X2),X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f27,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,[],[f24]) ).
fof(f28,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,[],[f27]) ).
fof(f29,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f30,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])],[f28,f29]) ).
fof(f31,plain,
! [X0,X1] :
( ( member(X0,power_set(X1))
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ member(X0,power_set(X1)) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f34,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(f35,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,[],[f34]) ).
fof(f38,plain,
! [X0,X1] :
( ( member(X0,singleton(X1))
| X0 != X1 )
& ( X0 = X1
| ~ member(X0,singleton(X1)) ) ),
inference(nnf_transformation,[],[f19]) ).
fof(f49,plain,
? [X0,X1,X2] :
( ( ~ subset(union(X1,X2),X0)
| ~ subset(X2,X0)
| ~ subset(X1,X0) )
& ( subset(union(X1,X2),X0)
| ( subset(X2,X0)
& subset(X1,X0) ) ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f50,plain,
? [X0,X1,X2] :
( ( ~ subset(union(X1,X2),X0)
| ~ subset(X2,X0)
| ~ subset(X1,X0) )
& ( subset(union(X1,X2),X0)
| ( subset(X2,X0)
& subset(X1,X0) ) ) ),
inference(flattening,[],[f49]) ).
fof(f51,plain,
( ? [X0,X1,X2] :
( ( ~ subset(union(X1,X2),X0)
| ~ subset(X2,X0)
| ~ subset(X1,X0) )
& ( subset(union(X1,X2),X0)
| ( subset(X2,X0)
& subset(X1,X0) ) ) )
=> ( ( ~ subset(union(sK4,sK5),sK3)
| ~ subset(sK5,sK3)
| ~ subset(sK4,sK3) )
& ( subset(union(sK4,sK5),sK3)
| ( subset(sK5,sK3)
& subset(sK4,sK3) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f52,plain,
( ( ~ subset(union(sK4,sK5),sK3)
| ~ subset(sK5,sK3)
| ~ subset(sK4,sK3) )
& ( subset(union(sK4,sK5),sK3)
| ( subset(sK5,sK3)
& subset(sK4,sK3) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f50,f51]) ).
fof(f53,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f54,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f30]) ).
fof(f55,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f56,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(X0,power_set(X1)) ),
inference(cnf_transformation,[],[f31]) ).
fof(f57,plain,
! [X0,X1] :
( member(X0,power_set(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f61,plain,
! [X2,X0,X1] :
( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f35]) ).
fof(f62,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f63,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f35]) ).
fof(f68,plain,
! [X0,X1] :
( X0 = X1
| ~ member(X0,singleton(X1)) ),
inference(cnf_transformation,[],[f38]) ).
fof(f69,plain,
! [X0,X1] :
( member(X0,singleton(X1))
| X0 != X1 ),
inference(cnf_transformation,[],[f38]) ).
fof(f79,plain,
( subset(union(sK4,sK5),sK3)
| subset(sK4,sK3) ),
inference(cnf_transformation,[],[f52]) ).
fof(f80,plain,
( subset(union(sK4,sK5),sK3)
| subset(sK5,sK3) ),
inference(cnf_transformation,[],[f52]) ).
fof(f81,plain,
( ~ subset(union(sK4,sK5),sK3)
| ~ subset(sK5,sK3)
| ~ subset(sK4,sK3) ),
inference(cnf_transformation,[],[f52]) ).
fof(f82,plain,
! [X1] : member(X1,singleton(X1)),
inference(equality_resolution,[],[f69]) ).
cnf(c_49,plain,
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f55]) ).
cnf(c_50,plain,
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f54]) ).
cnf(c_51,plain,
( ~ subset(X0,X1)
| ~ member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f53]) ).
cnf(c_52,plain,
( ~ subset(X0,X1)
| member(X0,power_set(X1)) ),
inference(cnf_transformation,[],[f57]) ).
cnf(c_53,plain,
( ~ member(X0,power_set(X1))
| subset(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
cnf(c_57,plain,
( ~ member(X0,X1)
| member(X0,union(X2,X1)) ),
inference(cnf_transformation,[],[f63]) ).
cnf(c_58,plain,
( ~ member(X0,X1)
| member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f62]) ).
cnf(c_59,plain,
( ~ member(X0,union(X1,X2))
| member(X0,X1)
| member(X0,X2) ),
inference(cnf_transformation,[],[f61]) ).
cnf(c_64,plain,
member(X0,singleton(X0)),
inference(cnf_transformation,[],[f82]) ).
cnf(c_65,plain,
( ~ member(X0,singleton(X1))
| X0 = X1 ),
inference(cnf_transformation,[],[f68]) ).
cnf(c_75,negated_conjecture,
( ~ subset(union(sK4,sK5),sK3)
| ~ subset(sK4,sK3)
| ~ subset(sK5,sK3) ),
inference(cnf_transformation,[],[f81]) ).
cnf(c_76,negated_conjecture,
( subset(union(sK4,sK5),sK3)
| subset(sK5,sK3) ),
inference(cnf_transformation,[],[f80]) ).
cnf(c_77,negated_conjecture,
( subset(union(sK4,sK5),sK3)
| subset(sK4,sK3) ),
inference(cnf_transformation,[],[f79]) ).
cnf(c_451,plain,
union(sK4,sK5) = sP0_iProver_def,
definition ).
cnf(c_452,negated_conjecture,
( subset(sK4,sK3)
| subset(sP0_iProver_def,sK3) ),
inference(demodulation,[status(thm)],[c_77,c_451]) ).
cnf(c_453,negated_conjecture,
( subset(sK5,sK3)
| subset(sP0_iProver_def,sK3) ),
inference(demodulation,[status(thm)],[c_76]) ).
cnf(c_454,negated_conjecture,
( ~ subset(sK4,sK3)
| ~ subset(sK5,sK3)
| ~ subset(sP0_iProver_def,sK3) ),
inference(demodulation,[status(thm)],[c_75]) ).
cnf(c_1046,plain,
( ~ subset(sK0(X0,power_set(X1)),X1)
| subset(X0,power_set(X1)) ),
inference(superposition,[status(thm)],[c_52,c_49]) ).
cnf(c_1139,plain,
( sK0(singleton(X0),X1) = X0
| subset(singleton(X0),X1) ),
inference(superposition,[status(thm)],[c_50,c_65]) ).
cnf(c_1206,plain,
( ~ member(sK0(sP0_iProver_def,sK3),sK3)
| subset(sP0_iProver_def,sK3) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_1296,plain,
( ~ subset(X0,X1)
| member(sK0(X0,X2),X1)
| subset(X0,X2) ),
inference(superposition,[status(thm)],[c_50,c_51]) ).
cnf(c_1300,plain,
( ~ subset(singleton(X0),X1)
| member(X0,X1) ),
inference(superposition,[status(thm)],[c_64,c_51]) ).
cnf(c_1777,plain,
( ~ member(X0,sK5)
| member(X0,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_451,c_57]) ).
cnf(c_1787,plain,
( member(sK0(sK5,X0),sP0_iProver_def)
| subset(sK5,X0) ),
inference(superposition,[status(thm)],[c_50,c_1777]) ).
cnf(c_1858,plain,
( ~ member(X0,sK4)
| member(X0,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_451,c_58]) ).
cnf(c_1931,plain,
( member(sK0(sK4,X0),sP0_iProver_def)
| subset(sK4,X0) ),
inference(superposition,[status(thm)],[c_50,c_1858]) ).
cnf(c_2784,plain,
( ~ subset(sP0_iProver_def,X0)
| member(sK0(sK5,X1),X0)
| subset(sK5,X1) ),
inference(superposition,[status(thm)],[c_1787,c_51]) ).
cnf(c_2785,plain,
( ~ subset(sP0_iProver_def,X0)
| member(sK0(sK4,X1),X0)
| subset(sK4,X1) ),
inference(superposition,[status(thm)],[c_1931,c_51]) ).
cnf(c_3157,plain,
( ~ member(X0,sP0_iProver_def)
| member(X0,sK4)
| member(X0,sK5) ),
inference(superposition,[status(thm)],[c_451,c_59]) ).
cnf(c_29099,plain,
( sK0(singleton(X0),X1) = X0
| member(X0,X1) ),
inference(superposition,[status(thm)],[c_1139,c_1300]) ).
cnf(c_29765,plain,
( sK0(singleton(X0),power_set(X1)) = X0
| subset(X0,X1) ),
inference(superposition,[status(thm)],[c_29099,c_53]) ).
cnf(c_71248,plain,
( ~ subset(sK4,sK3)
| ~ subset(sP0_iProver_def,sK3)
| sK0(singleton(sK5),power_set(sK3)) = sK5 ),
inference(superposition,[status(thm)],[c_29765,c_454]) ).
cnf(c_72050,plain,
( ~ subset(sP0_iProver_def,sK3)
| sK0(singleton(sK4),power_set(sK3)) = sK4
| sK0(singleton(sK5),power_set(sK3)) = sK5 ),
inference(superposition,[status(thm)],[c_29765,c_71248]) ).
cnf(c_72061,plain,
( sK0(singleton(sK4),power_set(sK3)) = sK4
| sK0(singleton(sK5),power_set(sK3)) = sK5
| sK0(singleton(sP0_iProver_def),power_set(sK3)) = sP0_iProver_def ),
inference(superposition,[status(thm)],[c_29765,c_72050]) ).
cnf(c_72073,plain,
( ~ subset(sK5,sK3)
| sK0(singleton(sK4),power_set(sK3)) = sK4
| sK0(singleton(sP0_iProver_def),power_set(sK3)) = sP0_iProver_def
| subset(singleton(sK5),power_set(sK3)) ),
inference(superposition,[status(thm)],[c_72061,c_1046]) ).
cnf(c_117542,plain,
( ~ subset(sP0_iProver_def,X0)
| subset(sK5,X0) ),
inference(superposition,[status(thm)],[c_2784,c_49]) ).
cnf(c_117626,plain,
( ~ subset(sP0_iProver_def,sK3)
| subset(sK5,sK3) ),
inference(instantiation,[status(thm)],[c_117542]) ).
cnf(c_118681,plain,
( ~ subset(singleton(sK5),X0)
| sK0(singleton(sK4),power_set(sK3)) = sK4
| sK0(singleton(sP0_iProver_def),power_set(sK3)) = sP0_iProver_def
| subset(singleton(sK5),power_set(sK3))
| member(sK5,X0) ),
inference(superposition,[status(thm)],[c_72061,c_1296]) ).
cnf(c_118945,plain,
( ~ subset(sP0_iProver_def,X0)
| subset(sK4,X0) ),
inference(superposition,[status(thm)],[c_2785,c_49]) ).
cnf(c_119029,plain,
( ~ subset(sP0_iProver_def,sK3)
| subset(sK4,sK3) ),
inference(instantiation,[status(thm)],[c_118945]) ).
cnf(c_119107,plain,
( subset(singleton(sK5),power_set(sK3))
| sK0(singleton(sP0_iProver_def),power_set(sK3)) = sP0_iProver_def
| sK0(singleton(sK4),power_set(sK3)) = sK4 ),
inference(global_subsumption_just,[status(thm)],[c_118681,c_453,c_72073,c_117626]) ).
cnf(c_119108,plain,
( sK0(singleton(sK4),power_set(sK3)) = sK4
| sK0(singleton(sP0_iProver_def),power_set(sK3)) = sP0_iProver_def
| subset(singleton(sK5),power_set(sK3)) ),
inference(renaming,[status(thm)],[c_119107]) ).
cnf(c_119115,plain,
( sK0(singleton(sK4),power_set(sK3)) = sK4
| sK0(singleton(sP0_iProver_def),power_set(sK3)) = sP0_iProver_def
| member(sK5,power_set(sK3)) ),
inference(superposition,[status(thm)],[c_119108,c_1300]) ).
cnf(c_119126,plain,
( sK0(singleton(sK4),power_set(sK3)) = sK4
| sK0(singleton(sP0_iProver_def),power_set(sK3)) = sP0_iProver_def
| subset(sK5,sK3) ),
inference(superposition,[status(thm)],[c_119115,c_53]) ).
cnf(c_119141,plain,
subset(sK5,sK3),
inference(global_subsumption_just,[status(thm)],[c_119126,c_453,c_117626]) ).
cnf(c_119143,plain,
( ~ subset(sK4,sK3)
| ~ subset(sP0_iProver_def,sK3) ),
inference(backward_subsumption_resolution,[status(thm)],[c_454,c_119141]) ).
cnf(c_119146,plain,
~ subset(sP0_iProver_def,sK3),
inference(global_subsumption_just,[status(thm)],[c_119143,c_119029,c_119143]) ).
cnf(c_360791,plain,
( member(sK0(sP0_iProver_def,X0),sK4)
| member(sK0(sP0_iProver_def,X0),sK5)
| subset(sP0_iProver_def,X0) ),
inference(superposition,[status(thm)],[c_50,c_3157]) ).
cnf(c_362830,plain,
( ~ subset(sK5,X0)
| member(sK0(sP0_iProver_def,X1),X0)
| member(sK0(sP0_iProver_def,X1),sK4)
| subset(sP0_iProver_def,X1) ),
inference(superposition,[status(thm)],[c_360791,c_51]) ).
cnf(c_362846,plain,
( ~ subset(sK5,sK3)
| member(sK0(sP0_iProver_def,sK3),sK4)
| member(sK0(sP0_iProver_def,sK3),sK3)
| subset(sP0_iProver_def,sK3) ),
inference(instantiation,[status(thm)],[c_362830]) ).
cnf(c_727768,plain,
( ~ member(sK0(sP0_iProver_def,sK3),sK4)
| ~ subset(sK4,X0)
| member(sK0(sP0_iProver_def,sK3),X0) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_727769,plain,
( ~ member(sK0(sP0_iProver_def,sK3),sK4)
| ~ subset(sK4,sK3)
| member(sK0(sP0_iProver_def,sK3),sK3) ),
inference(instantiation,[status(thm)],[c_727768]) ).
cnf(c_727770,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_727769,c_362846,c_119146,c_119141,c_1206,c_452]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET014+4 : TPTP v8.2.0. Released v2.2.0.
% 0.03/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun Jun 23 18:05:39 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 92.66/13.28 % SZS status Started for theBenchmark.p
% 92.66/13.28 % SZS status Theorem for theBenchmark.p
% 92.66/13.28
% 92.66/13.28 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 92.66/13.28
% 92.66/13.28 ------ iProver source info
% 92.66/13.28
% 92.66/13.28 git: date: 2024-06-12 09:56:46 +0000
% 92.66/13.28 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 92.66/13.28 git: non_committed_changes: false
% 92.66/13.28
% 92.66/13.28 ------ Parsing...
% 92.66/13.28 ------ Clausification by vclausify_rel & Parsing by iProver...
% 92.66/13.28
% 92.66/13.28 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 92.66/13.28
% 92.66/13.28 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 92.66/13.28
% 92.66/13.28 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 92.66/13.28 ------ Proving...
% 92.66/13.28 ------ Problem Properties
% 92.66/13.28
% 92.66/13.28
% 92.66/13.28 clauses 30
% 92.66/13.28 conjectures 3
% 92.66/13.28 EPR 5
% 92.66/13.28 Horn 23
% 92.66/13.28 unary 5
% 92.66/13.28 binary 17
% 92.66/13.28 lits 63
% 92.66/13.28 lits eq 4
% 92.66/13.28 fd_pure 0
% 92.66/13.28 fd_pseudo 0
% 92.66/13.28 fd_cond 0
% 92.66/13.28 fd_pseudo_cond 2
% 92.66/13.28 AC symbols 0
% 92.66/13.28
% 92.66/13.28 ------ Schedule dynamic 5 is on
% 92.66/13.28
% 92.66/13.28 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 92.66/13.28
% 92.66/13.28
% 92.66/13.28 ------
% 92.66/13.28 Current options:
% 92.66/13.28 ------
% 92.66/13.28
% 92.66/13.28
% 92.66/13.28
% 92.66/13.28
% 92.66/13.28 ------ Proving...
% 92.66/13.28 Proof_search_loop: time out after: 8412 full_loop iterations
% 92.66/13.28
% 92.66/13.28 ------ Input Options"1. --res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15.
% 92.66/13.28
% 92.66/13.28
% 92.66/13.28 ------
% 92.66/13.28 Current options:
% 92.66/13.28 ------
% 92.66/13.28
% 92.66/13.28
% 92.66/13.28
% 92.66/13.28
% 92.66/13.28 ------ Proving...
% 92.66/13.28
% 92.66/13.28
% 92.66/13.28 % SZS status Theorem for theBenchmark.p
% 92.66/13.28
% 92.66/13.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 92.66/13.28
% 92.66/13.29
%------------------------------------------------------------------------------