TSTP Solution File: SWC312+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC312+1 : TPTP v8.1.2. Released v2.4.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:11:57 EDT 2024
% Result : Theorem 3.77s 1.14s
% Output : CNFRefutation 3.77s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X0
& app(cons(X6,nil),X7) = X1
& ssList(X7) )
& ssItem(X6) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( app(X5,cons(X4,nil)) != X2
| app(cons(X4,nil),X5) != X3
| ~ ssList(X5) ) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X0
& app(cons(X6,nil),X7) = X1
& ssList(X7) )
& ssItem(X6) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( app(X5,cons(X4,nil)) != X2
| app(cons(X4,nil),X5) != X3
| ~ ssList(X5) ) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X0
& app(cons(X4,nil),X5) = X1
& ssList(X5) )
& ssItem(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( app(X7,cons(X6,nil)) != X2
| app(cons(X6,nil),X7) != X3
| ~ ssList(X7) ) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != X0
| app(cons(X4,nil),X5) != X1
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X2
& app(cons(X6,nil),X7) = X3
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != X0
| app(cons(X4,nil),X5) != X1
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X2
& app(cons(X6,nil),X7) = X3
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK53
| app(cons(X4,nil),X5) != X1
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil != sK53
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X2
& app(cons(X6,nil),X7) = X3
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = X2 )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK53
| app(cons(X4,nil),X5) != X1
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil != sK53
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X2
& app(cons(X6,nil),X7) = X3
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = X2 )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK53
| app(cons(X4,nil),X5) != sK54
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X2
& app(cons(X6,nil),X7) = X3
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = X2 )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK53
| app(cons(X4,nil),X5) != sK54
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X2
& app(cons(X6,nil),X7) = X3
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = X2 )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK53
| app(cons(X4,nil),X5) != sK54
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = sK55
& app(cons(X6,nil),X7) = X3
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = sK55 )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK53
| app(cons(X4,nil),X5) != sK54
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = sK55
& app(cons(X6,nil),X7) = X3
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = sK55 )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK53
| app(cons(X4,nil),X5) != sK54
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(sK56,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = sK55
& app(cons(X6,nil),X7) = sK56
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != sK56
| nil = sK55 )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = sK55
& app(cons(X6,nil),X7) = sK56
& ssList(X7) )
& ssItem(X6) )
=> ( ? [X7] :
( sK55 = app(X7,cons(sK57,nil))
& sK56 = app(cons(sK57,nil),X7)
& ssList(X7) )
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ? [X7] :
( sK55 = app(X7,cons(sK57,nil))
& sK56 = app(cons(sK57,nil),X7)
& ssList(X7) )
=> ( sK55 = app(sK58,cons(sK57,nil))
& sK56 = app(cons(sK57,nil),sK58)
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK53
| app(cons(X4,nil),X5) != sK54
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& ( ~ neq(sK56,nil)
| ( sK55 = app(sK58,cons(sK57,nil))
& sK56 = app(cons(sK57,nil),sK58)
& ssList(sK58)
& ssItem(sK57) ) )
& ( nil != sK56
| nil = sK55 )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58])],[f222,f348,f347,f346,f345,f344,f343]) ).
fof(f553,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f349]) ).
fof(f554,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f349]) ).
fof(f555,plain,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f349]) ).
fof(f556,plain,
( ~ neq(sK56,nil)
| ssItem(sK57) ),
inference(cnf_transformation,[],[f349]) ).
fof(f557,plain,
( ~ neq(sK56,nil)
| ssList(sK58) ),
inference(cnf_transformation,[],[f349]) ).
fof(f558,plain,
( ~ neq(sK56,nil)
| sK56 = app(cons(sK57,nil),sK58) ),
inference(cnf_transformation,[],[f349]) ).
fof(f559,plain,
( ~ neq(sK56,nil)
| sK55 = app(sK58,cons(sK57,nil)) ),
inference(cnf_transformation,[],[f349]) ).
fof(f560,plain,
( neq(sK54,nil)
| nil = sK54 ),
inference(cnf_transformation,[],[f349]) ).
fof(f561,plain,
( neq(sK54,nil)
| nil != sK53 ),
inference(cnf_transformation,[],[f349]) ).
fof(f562,plain,
! [X4,X5] :
( app(X5,cons(X4,nil)) != sK53
| app(cons(X4,nil),X5) != sK54
| ~ ssList(X5)
| ~ ssItem(X4)
| nil = sK54 ),
inference(cnf_transformation,[],[f349]) ).
fof(f563,plain,
! [X4,X5] :
( app(X5,cons(X4,nil)) != sK53
| app(cons(X4,nil),X5) != sK54
| ~ ssList(X5)
| ~ ssItem(X4)
| nil != sK53 ),
inference(cnf_transformation,[],[f349]) ).
fof(f564,plain,
! [X4,X5] :
( app(X5,cons(X4,nil)) != sK55
| app(cons(X4,nil),X5) != sK56
| ~ ssList(X5)
| ~ ssItem(X4)
| nil != sK55 ),
inference(definition_unfolding,[],[f563,f554,f553,f554]) ).
fof(f565,plain,
! [X4,X5] :
( app(X5,cons(X4,nil)) != sK55
| app(cons(X4,nil),X5) != sK56
| ~ ssList(X5)
| ~ ssItem(X4)
| nil = sK56 ),
inference(definition_unfolding,[],[f562,f554,f553,f553]) ).
fof(f566,plain,
( neq(sK56,nil)
| nil != sK55 ),
inference(definition_unfolding,[],[f561,f553,f554]) ).
fof(f567,plain,
( neq(sK56,nil)
| nil = sK56 ),
inference(definition_unfolding,[],[f560,f553,f553]) ).
cnf(c_246,negated_conjecture,
( app(cons(X0,nil),X1) != sK56
| app(X1,cons(X0,nil)) != sK55
| nil != sK55
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f564]) ).
cnf(c_247,negated_conjecture,
( app(cons(X0,nil),X1) != sK56
| app(X1,cons(X0,nil)) != sK55
| ~ ssItem(X0)
| ~ ssList(X1)
| nil = sK56 ),
inference(cnf_transformation,[],[f565]) ).
cnf(c_248,negated_conjecture,
( nil != sK55
| neq(sK56,nil) ),
inference(cnf_transformation,[],[f566]) ).
cnf(c_249,negated_conjecture,
( nil = sK56
| neq(sK56,nil) ),
inference(cnf_transformation,[],[f567]) ).
cnf(c_250,negated_conjecture,
( ~ neq(sK56,nil)
| app(sK58,cons(sK57,nil)) = sK55 ),
inference(cnf_transformation,[],[f559]) ).
cnf(c_251,negated_conjecture,
( ~ neq(sK56,nil)
| app(cons(sK57,nil),sK58) = sK56 ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_252,negated_conjecture,
( ~ neq(sK56,nil)
| ssList(sK58) ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_253,negated_conjecture,
( ~ neq(sK56,nil)
| ssItem(sK57) ),
inference(cnf_transformation,[],[f556]) ).
cnf(c_254,negated_conjecture,
( nil != sK56
| nil = sK55 ),
inference(cnf_transformation,[],[f555]) ).
cnf(c_367,negated_conjecture,
ssItem(sK57),
inference(global_subsumption_just,[status(thm)],[c_253,c_253,c_249,c_248,c_254]) ).
cnf(c_369,negated_conjecture,
ssList(sK58),
inference(global_subsumption_just,[status(thm)],[c_252,c_252,c_249,c_248,c_254]) ).
cnf(c_377,negated_conjecture,
neq(sK56,nil),
inference(global_subsumption_just,[status(thm)],[c_249,c_249,c_248,c_254]) ).
cnf(c_387,negated_conjecture,
app(cons(sK57,nil),sK58) = sK56,
inference(global_subsumption_just,[status(thm)],[c_251,c_249,c_248,c_254,c_251]) ).
cnf(c_389,negated_conjecture,
app(sK58,cons(sK57,nil)) = sK55,
inference(global_subsumption_just,[status(thm)],[c_250,c_250,c_377]) ).
cnf(c_397,plain,
( ~ ssList(X1)
| ~ ssItem(X0)
| app(X1,cons(X0,nil)) != sK55
| app(cons(X0,nil),X1) != sK56 ),
inference(global_subsumption_just,[status(thm)],[c_247,c_254,c_247,c_246]) ).
cnf(c_398,negated_conjecture,
( app(cons(X0,nil),X1) != sK56
| app(X1,cons(X0,nil)) != sK55
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(renaming,[status(thm)],[c_397]) ).
cnf(c_400,plain,
( app(X1,cons(X0,nil)) != sK55
| app(cons(X0,nil),X1) != sK56
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(global_subsumption_just,[status(thm)],[c_246,c_398]) ).
cnf(c_401,negated_conjecture,
( app(cons(X0,nil),X1) != sK56
| app(X1,cons(X0,nil)) != sK55
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(renaming,[status(thm)],[c_400]) ).
cnf(c_8862,plain,
cons(sK57,nil) = sP0_iProver_def,
definition ).
cnf(c_8863,plain,
app(sK58,sP0_iProver_def) = sP1_iProver_def,
definition ).
cnf(c_8864,plain,
app(sP0_iProver_def,sK58) = sP2_iProver_def,
definition ).
cnf(c_8865,negated_conjecture,
( app(cons(X0,nil),X1) != sK56
| app(X1,cons(X0,nil)) != sK55
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(demodulation,[status(thm)],[c_401]) ).
cnf(c_8866,negated_conjecture,
sP1_iProver_def = sK55,
inference(demodulation,[status(thm)],[c_389,c_8862,c_8863]) ).
cnf(c_8867,negated_conjecture,
sP2_iProver_def = sK56,
inference(demodulation,[status(thm)],[c_387,c_8864]) ).
cnf(c_8868,negated_conjecture,
ssList(sK58),
inference(demodulation,[status(thm)],[c_369]) ).
cnf(c_8869,negated_conjecture,
ssItem(sK57),
inference(demodulation,[status(thm)],[c_367]) ).
cnf(c_11701,plain,
( app(cons(X0,nil),X1) != sP2_iProver_def
| app(X1,cons(X0,nil)) != sP1_iProver_def
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(light_normalisation,[status(thm)],[c_8865,c_8866,c_8867]) ).
cnf(c_11711,plain,
( app(X0,cons(sK57,nil)) != sP1_iProver_def
| app(sP0_iProver_def,X0) != sP2_iProver_def
| ~ ssList(X0)
| ~ ssItem(sK57) ),
inference(superposition,[status(thm)],[c_8862,c_11701]) ).
cnf(c_11712,plain,
( app(X0,sP0_iProver_def) != sP1_iProver_def
| app(sP0_iProver_def,X0) != sP2_iProver_def
| ~ ssList(X0)
| ~ ssItem(sK57) ),
inference(light_normalisation,[status(thm)],[c_11711,c_8862]) ).
cnf(c_11713,plain,
( app(X0,sP0_iProver_def) != sP1_iProver_def
| app(sP0_iProver_def,X0) != sP2_iProver_def
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11712,c_8869]) ).
cnf(c_11812,plain,
( app(sK58,sP0_iProver_def) != sP1_iProver_def
| ~ ssList(sK58) ),
inference(superposition,[status(thm)],[c_8864,c_11713]) ).
cnf(c_11813,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11812,c_8868,c_8863]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC312+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n003.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 : Thu May 2 23:35:50 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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.77/1.14 % SZS status Started for theBenchmark.p
% 3.77/1.14 % SZS status Theorem for theBenchmark.p
% 3.77/1.14
% 3.77/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.77/1.14
% 3.77/1.14 ------ iProver source info
% 3.77/1.14
% 3.77/1.14 git: date: 2024-05-02 19:28:25 +0000
% 3.77/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.77/1.14 git: non_committed_changes: false
% 3.77/1.14
% 3.77/1.14 ------ Parsing...
% 3.77/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.77/1.14
% 3.77/1.14 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e
% 3.77/1.14
% 3.77/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.77/1.14
% 3.77/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.77/1.14 ------ Proving...
% 3.77/1.14 ------ Problem Properties
% 3.77/1.14
% 3.77/1.14
% 3.77/1.14 clauses 191
% 3.77/1.14 conjectures 7
% 3.77/1.14 EPR 56
% 3.77/1.14 Horn 123
% 3.77/1.14 unary 26
% 3.77/1.14 binary 40
% 3.77/1.14 lits 632
% 3.77/1.14 lits eq 86
% 3.77/1.14 fd_pure 0
% 3.77/1.14 fd_pseudo 0
% 3.77/1.14 fd_cond 21
% 3.77/1.14 fd_pseudo_cond 14
% 3.77/1.14 AC symbols 0
% 3.77/1.14
% 3.77/1.14 ------ Schedule dynamic 5 is on
% 3.77/1.14
% 3.77/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.77/1.14
% 3.77/1.14
% 3.77/1.14 ------
% 3.77/1.14 Current options:
% 3.77/1.14 ------
% 3.77/1.14
% 3.77/1.14
% 3.77/1.14
% 3.77/1.14
% 3.77/1.14 ------ Proving...
% 3.77/1.14
% 3.77/1.14
% 3.77/1.14 % SZS status Theorem for theBenchmark.p
% 3.77/1.14
% 3.77/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.77/1.14
% 3.77/1.15
%------------------------------------------------------------------------------