TSTP Solution File: SWW948+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWW948+1 : TPTP v8.1.2. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n020.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 Sep 1 00:41:31 EDT 2023
% Result : Theorem 3.34s 1.19s
% Output : CNFRefutation 3.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 16
% Syntax : Number of formulae : 95 ( 41 unt; 0 def)
% Number of atoms : 166 ( 19 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 126 ( 55 ~; 51 |; 4 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 110 ( 2 sgn; 72 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f67,axiom,
! [X0] : constr_ZERO = constr_xor(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax66) ).
fof(f68,axiom,
! [X1] : constr_xor(X1,constr_ZERO) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax67) ).
fof(f69,axiom,
! [X2,X3] : constr_xor(X2,X3) = constr_xor(X3,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax68) ).
fof(f70,axiom,
! [X4,X5,X6] : constr_xor(X4,constr_xor(X5,X6)) = constr_xor(constr_xor(X4,X5),X6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax69) ).
fof(f71,axiom,
! [X7,X8] :
( ( pred_attacker(X8)
& pred_attacker(X7) )
=> pred_attacker(constr_xor(X7,X8)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax70) ).
fof(f76,axiom,
! [X13,X14] :
( pred_attacker(tuple_knowledge_from_1st_round_out_2(X13,X14))
=> pred_attacker(X13) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax75) ).
fof(f77,axiom,
! [X15,X16] :
( pred_attacker(tuple_knowledge_from_1st_round_out_2(X15,X16))
=> pred_attacker(X16) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax76) ).
fof(f79,axiom,
! [X18] :
( pred_attacker(tuple_knowledge_from_1st_round_out_1(X18))
=> pred_attacker(X18) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax78) ).
fof(f84,axiom,
! [X21] :
( pred_attacker(tuple_R_out_4(X21))
=> pred_attacker(X21) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax83) ).
fof(f88,axiom,
! [X25] :
( pred_attacker(tuple_R_out_1(X25))
=> pred_attacker(X25) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax87) ).
fof(f89,axiom,
! [X26,X27] :
( ( pred_attacker(X27)
& pred_attacker(X26) )
=> pred_attacker(tuple_R_in_2(X26,X27)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax88) ).
fof(f102,axiom,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r0x30_from_1st)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax101) ).
fof(f103,axiom,
pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(constr_xor(name_r0x30_from_1st,name_r1_from_1st),name_k)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax102) ).
fof(f105,axiom,
pred_attacker(tuple_R_out_1(name_r0x30)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax104) ).
fof(f107,axiom,
! [X39] :
( pred_attacker(tuple_R_in_2(X39,constr_h(constr_xor(constr_xor(name_r0x30,X39),name_k))))
=> pred_attacker(tuple_R_out_4(name_objective_R)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax106) ).
fof(f108,conjecture,
pred_attacker(name_objective_R),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(f109,negated_conjecture,
~ pred_attacker(name_objective_R),
inference(negated_conjecture,[],[f108]) ).
fof(f110,plain,
! [X0] : constr_xor(X0,constr_ZERO) = X0,
inference(rectify,[],[f68]) ).
fof(f111,plain,
! [X0,X1] : constr_xor(X0,X1) = constr_xor(X1,X0),
inference(rectify,[],[f69]) ).
fof(f112,plain,
! [X0,X1,X2] : constr_xor(X0,constr_xor(X1,X2)) = constr_xor(constr_xor(X0,X1),X2),
inference(rectify,[],[f70]) ).
fof(f113,plain,
! [X0,X1] :
( ( pred_attacker(X1)
& pred_attacker(X0) )
=> pred_attacker(constr_xor(X0,X1)) ),
inference(rectify,[],[f71]) ).
fof(f117,plain,
! [X0,X1] :
( pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1))
=> pred_attacker(X0) ),
inference(rectify,[],[f76]) ).
fof(f118,plain,
! [X0,X1] :
( pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1))
=> pred_attacker(X1) ),
inference(rectify,[],[f77]) ).
fof(f120,plain,
! [X0] :
( pred_attacker(tuple_knowledge_from_1st_round_out_1(X0))
=> pred_attacker(X0) ),
inference(rectify,[],[f79]) ).
fof(f123,plain,
! [X0] :
( pred_attacker(tuple_R_out_4(X0))
=> pred_attacker(X0) ),
inference(rectify,[],[f84]) ).
fof(f127,plain,
! [X0] :
( pred_attacker(tuple_R_out_1(X0))
=> pred_attacker(X0) ),
inference(rectify,[],[f88]) ).
fof(f128,plain,
! [X0,X1] :
( ( pred_attacker(X1)
& pred_attacker(X0) )
=> pred_attacker(tuple_R_in_2(X0,X1)) ),
inference(rectify,[],[f89]) ).
fof(f136,plain,
! [X0] :
( pred_attacker(tuple_R_in_2(X0,constr_h(constr_xor(constr_xor(name_r0x30,X0),name_k))))
=> pred_attacker(tuple_R_out_4(name_objective_R)) ),
inference(rectify,[],[f107]) ).
fof(f137,plain,
~ pred_attacker(name_objective_R),
inference(flattening,[],[f109]) ).
fof(f139,plain,
! [X0,X1] :
( pred_attacker(constr_xor(X0,X1))
| ~ pred_attacker(X1)
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f113]) ).
fof(f140,plain,
! [X0,X1] :
( pred_attacker(constr_xor(X0,X1))
| ~ pred_attacker(X1)
| ~ pred_attacker(X0) ),
inference(flattening,[],[f139]) ).
fof(f145,plain,
! [X0,X1] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1)) ),
inference(ennf_transformation,[],[f117]) ).
fof(f146,plain,
! [X0,X1] :
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1)) ),
inference(ennf_transformation,[],[f118]) ).
fof(f148,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X0)) ),
inference(ennf_transformation,[],[f120]) ).
fof(f151,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_R_out_4(X0)) ),
inference(ennf_transformation,[],[f123]) ).
fof(f155,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_R_out_1(X0)) ),
inference(ennf_transformation,[],[f127]) ).
fof(f156,plain,
! [X0,X1] :
( pred_attacker(tuple_R_in_2(X0,X1))
| ~ pred_attacker(X1)
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f128]) ).
fof(f157,plain,
! [X0,X1] :
( pred_attacker(tuple_R_in_2(X0,X1))
| ~ pred_attacker(X1)
| ~ pred_attacker(X0) ),
inference(flattening,[],[f156]) ).
fof(f165,plain,
! [X0] :
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(tuple_R_in_2(X0,constr_h(constr_xor(constr_xor(name_r0x30,X0),name_k)))) ),
inference(ennf_transformation,[],[f136]) ).
fof(f232,plain,
! [X0] : constr_ZERO = constr_xor(X0,X0),
inference(cnf_transformation,[],[f67]) ).
fof(f233,plain,
! [X0] : constr_xor(X0,constr_ZERO) = X0,
inference(cnf_transformation,[],[f110]) ).
fof(f234,plain,
! [X0,X1] : constr_xor(X0,X1) = constr_xor(X1,X0),
inference(cnf_transformation,[],[f111]) ).
fof(f235,plain,
! [X2,X0,X1] : constr_xor(X0,constr_xor(X1,X2)) = constr_xor(constr_xor(X0,X1),X2),
inference(cnf_transformation,[],[f112]) ).
fof(f236,plain,
! [X0,X1] :
( pred_attacker(constr_xor(X0,X1))
| ~ pred_attacker(X1)
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f140]) ).
fof(f241,plain,
! [X0,X1] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1)) ),
inference(cnf_transformation,[],[f145]) ).
fof(f242,plain,
! [X0,X1] :
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1)) ),
inference(cnf_transformation,[],[f146]) ).
fof(f244,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X0)) ),
inference(cnf_transformation,[],[f148]) ).
fof(f249,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_R_out_4(X0)) ),
inference(cnf_transformation,[],[f151]) ).
fof(f253,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_R_out_1(X0)) ),
inference(cnf_transformation,[],[f155]) ).
fof(f254,plain,
! [X0,X1] :
( pred_attacker(tuple_R_in_2(X0,X1))
| ~ pred_attacker(X1)
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f157]) ).
fof(f266,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r0x30_from_1st)),
inference(cnf_transformation,[],[f102]) ).
fof(f267,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(constr_xor(name_r0x30_from_1st,name_r1_from_1st),name_k)))),
inference(cnf_transformation,[],[f103]) ).
fof(f269,plain,
pred_attacker(tuple_R_out_1(name_r0x30)),
inference(cnf_transformation,[],[f105]) ).
fof(f271,plain,
! [X0] :
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(tuple_R_in_2(X0,constr_h(constr_xor(constr_xor(name_r0x30,X0),name_k)))) ),
inference(cnf_transformation,[],[f165]) ).
fof(f272,plain,
~ pred_attacker(name_objective_R),
inference(cnf_transformation,[],[f137]) ).
cnf(c_115,plain,
constr_xor(X0,X0) = constr_ZERO,
inference(cnf_transformation,[],[f232]) ).
cnf(c_116,plain,
constr_xor(X0,constr_ZERO) = X0,
inference(cnf_transformation,[],[f233]) ).
cnf(c_117,plain,
constr_xor(X0,X1) = constr_xor(X1,X0),
inference(cnf_transformation,[],[f234]) ).
cnf(c_118,plain,
constr_xor(constr_xor(X0,X1),X2) = constr_xor(X0,constr_xor(X1,X2)),
inference(cnf_transformation,[],[f235]) ).
cnf(c_119,plain,
( ~ pred_attacker(X0)
| ~ pred_attacker(X1)
| pred_attacker(constr_xor(X0,X1)) ),
inference(cnf_transformation,[],[f236]) ).
cnf(c_124,plain,
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f241]) ).
cnf(c_125,plain,
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X0,X1))
| pred_attacker(X1) ),
inference(cnf_transformation,[],[f242]) ).
cnf(c_127,plain,
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f244]) ).
cnf(c_132,plain,
( ~ pred_attacker(tuple_R_out_4(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f249]) ).
cnf(c_136,plain,
( ~ pred_attacker(tuple_R_out_1(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f253]) ).
cnf(c_137,plain,
( ~ pred_attacker(X0)
| ~ pred_attacker(X1)
| pred_attacker(tuple_R_in_2(X0,X1)) ),
inference(cnf_transformation,[],[f254]) ).
cnf(c_149,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r0x30_from_1st)),
inference(cnf_transformation,[],[f266]) ).
cnf(c_150,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(constr_xor(name_r0x30_from_1st,name_r1_from_1st),name_k)))),
inference(cnf_transformation,[],[f267]) ).
cnf(c_152,plain,
pred_attacker(tuple_R_out_1(name_r0x30)),
inference(cnf_transformation,[],[f269]) ).
cnf(c_154,plain,
( ~ pred_attacker(tuple_R_in_2(X0,constr_h(constr_xor(constr_xor(name_r0x30,X0),name_k))))
| pred_attacker(tuple_R_out_4(name_objective_R)) ),
inference(cnf_transformation,[],[f271]) ).
cnf(c_155,negated_conjecture,
~ pred_attacker(name_objective_R),
inference(cnf_transformation,[],[f272]) ).
cnf(c_180,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(name_r1_from_1st,constr_h(constr_xor(name_k,constr_xor(name_r0x30_from_1st,name_r1_from_1st))))),
inference(theory_normalisation,[status(thm)],[c_150,c_118,c_117]) ).
cnf(c_183,plain,
( ~ pred_attacker(tuple_R_in_2(X0,constr_h(constr_xor(name_k,constr_xor(X0,name_r0x30)))))
| pred_attacker(tuple_R_out_4(name_objective_R)) ),
inference(theory_normalisation,[status(thm)],[c_154,c_118,c_117]) ).
cnf(c_773,plain,
( pred_attacker(tuple_R_out_4(name_objective_R))
| ~ pred_attacker(tuple_R_in_2(X0,constr_h(constr_xor(name_k,constr_xor(X0,name_r0x30))))) ),
inference(prop_impl_just,[status(thm)],[c_183]) ).
cnf(c_774,plain,
( ~ pred_attacker(tuple_R_in_2(X0,constr_h(constr_xor(name_k,constr_xor(X0,name_r0x30)))))
| pred_attacker(tuple_R_out_4(name_objective_R)) ),
inference(renaming,[status(thm)],[c_773]) ).
cnf(c_2314,plain,
constr_xor(X0,constr_xor(X1,X2)) = constr_xor(X1,constr_xor(X0,X2)),
inference(superposition,[status(thm)],[c_118,c_117]) ).
cnf(c_2348,plain,
pred_attacker(name_r0x30_from_1st),
inference(superposition,[status(thm)],[c_149,c_127]) ).
cnf(c_2388,plain,
pred_attacker(name_r0x30),
inference(superposition,[status(thm)],[c_152,c_136]) ).
cnf(c_2393,plain,
pred_attacker(name_r1_from_1st),
inference(superposition,[status(thm)],[c_180,c_124]) ).
cnf(c_2398,plain,
pred_attacker(constr_h(constr_xor(name_k,constr_xor(name_r0x30_from_1st,name_r1_from_1st)))),
inference(superposition,[status(thm)],[c_180,c_125]) ).
cnf(c_2412,plain,
constr_xor(constr_ZERO,X0) = X0,
inference(superposition,[status(thm)],[c_117,c_116]) ).
cnf(c_2414,plain,
( ~ pred_attacker(tuple_R_in_2(X0,constr_h(constr_xor(name_k,constr_xor(name_r0x30,X0)))))
| pred_attacker(tuple_R_out_4(name_objective_R)) ),
inference(superposition,[status(thm)],[c_117,c_774]) ).
cnf(c_2441,plain,
( ~ pred_attacker(X0)
| ~ pred_attacker(X1)
| pred_attacker(constr_xor(X1,X0)) ),
inference(superposition,[status(thm)],[c_117,c_119]) ).
cnf(c_2487,plain,
constr_xor(X0,constr_xor(X0,X1)) = constr_xor(constr_ZERO,X1),
inference(superposition,[status(thm)],[c_115,c_118]) ).
cnf(c_2533,plain,
constr_xor(X0,constr_xor(X0,X1)) = X1,
inference(demodulation,[status(thm)],[c_2487,c_2412]) ).
cnf(c_2647,plain,
( ~ pred_attacker(constr_xor(X0,X1))
| ~ pred_attacker(X2)
| pred_attacker(constr_xor(X0,constr_xor(X2,X1))) ),
inference(superposition,[status(thm)],[c_2314,c_2441]) ).
cnf(c_2683,plain,
( ~ pred_attacker(tuple_R_in_2(constr_xor(name_r0x30,X0),constr_h(constr_xor(name_k,X0))))
| pred_attacker(tuple_R_out_4(name_objective_R)) ),
inference(superposition,[status(thm)],[c_2533,c_2414]) ).
cnf(c_2728,plain,
( ~ pred_attacker(constr_h(constr_xor(name_k,X0)))
| ~ pred_attacker(constr_xor(name_r0x30,X0))
| pred_attacker(tuple_R_out_4(name_objective_R)) ),
inference(superposition,[status(thm)],[c_137,c_2683]) ).
cnf(c_3722,plain,
( ~ pred_attacker(constr_xor(name_r0x30,constr_xor(name_r0x30_from_1st,name_r1_from_1st)))
| pred_attacker(tuple_R_out_4(name_objective_R)) ),
inference(superposition,[status(thm)],[c_2398,c_2728]) ).
cnf(c_3829,plain,
( ~ pred_attacker(constr_xor(name_r0x30,name_r1_from_1st))
| ~ pred_attacker(name_r0x30_from_1st)
| pred_attacker(tuple_R_out_4(name_objective_R)) ),
inference(superposition,[status(thm)],[c_2647,c_3722]) ).
cnf(c_3830,plain,
( ~ pred_attacker(constr_xor(name_r0x30,name_r1_from_1st))
| pred_attacker(tuple_R_out_4(name_objective_R)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3829,c_2348]) ).
cnf(c_3843,plain,
( ~ pred_attacker(name_r0x30)
| ~ pred_attacker(name_r1_from_1st)
| pred_attacker(tuple_R_out_4(name_objective_R)) ),
inference(superposition,[status(thm)],[c_2441,c_3830]) ).
cnf(c_3844,plain,
pred_attacker(tuple_R_out_4(name_objective_R)),
inference(forward_subsumption_resolution,[status(thm)],[c_3843,c_2393,c_2388]) ).
cnf(c_3845,plain,
pred_attacker(name_objective_R),
inference(superposition,[status(thm)],[c_3844,c_132]) ).
cnf(c_3846,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3845,c_155]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWW948+1 : TPTP v8.1.2. Released v7.4.0.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n020.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 Aug 27 20:44:29 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.34/1.19 % SZS status Started for theBenchmark.p
% 3.34/1.19 % SZS status Theorem for theBenchmark.p
% 3.34/1.19
% 3.34/1.19 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.34/1.19
% 3.34/1.19 ------ iProver source info
% 3.34/1.19
% 3.34/1.19 git: date: 2023-05-31 18:12:56 +0000
% 3.34/1.19 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.34/1.19 git: non_committed_changes: false
% 3.34/1.19 git: last_make_outside_of_git: false
% 3.34/1.19
% 3.34/1.19 ------ Parsing...
% 3.34/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.34/1.19
% 3.34/1.19 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.34/1.19
% 3.34/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.34/1.19
% 3.34/1.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.34/1.19 ------ Proving...
% 3.34/1.19 ------ Problem Properties
% 3.34/1.19
% 3.34/1.19
% 3.34/1.19 clauses 105
% 3.34/1.19 conjectures 1
% 3.34/1.19 EPR 76
% 3.34/1.19 Horn 105
% 3.34/1.19 unary 85
% 3.34/1.19 binary 17
% 3.34/1.19 lits 128
% 3.34/1.19 lits eq 70
% 3.34/1.19 fd_pure 0
% 3.34/1.19 fd_pseudo 0
% 3.34/1.19 fd_cond 0
% 3.34/1.19 fd_pseudo_cond 0
% 3.34/1.19 AC symbols 1
% 3.34/1.19
% 3.34/1.19 ------ Schedule dynamic 5 is on
% 3.34/1.19
% 3.34/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.34/1.19
% 3.34/1.19
% 3.34/1.19 ------
% 3.34/1.19 Current options:
% 3.34/1.19 ------
% 3.34/1.19
% 3.34/1.19
% 3.34/1.19
% 3.34/1.19
% 3.34/1.19 ------ Proving...
% 3.34/1.19
% 3.34/1.19
% 3.34/1.19 % SZS status Theorem for theBenchmark.p
% 3.34/1.19
% 3.34/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.34/1.19
% 3.34/1.19
%------------------------------------------------------------------------------