TSTP Solution File: SWW955+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWW955+1 : TPTP v8.1.2. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n015.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:26:55 EDT 2024
% Result : Theorem 2.77s 1.07s
% Output : CNFRefutation 2.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 68 ( 24 unt; 0 def)
% Number of atoms : 119 ( 7 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 91 ( 40 ~; 35 |; 2 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 64 ( 3 sgn 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f46,axiom,
! [X0,X1] : constr_dec(constr_enc(X1,X0),X0) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax45) ).
fof(f47,axiom,
! [X2,X3] : constr_comm_dec(constr_comm_enc(X3,X2),X2) = X3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax46) ).
fof(f48,axiom,
pred_attacker(tuple_true),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax47) ).
fof(f51,axiom,
! [X6,X7] :
( ( pred_attacker(X7)
& pred_attacker(X6) )
=> pred_attacker(constr_dec(X6,X7)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax50) ).
fof(f66,axiom,
! [X19] :
( pred_attacker(tuple_A_out_4(X19))
=> pred_attacker(X19) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax65) ).
fof(f68,axiom,
! [X21] :
( pred_attacker(tuple_A_out_3(X21))
=> pred_attacker(X21) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax67) ).
fof(f70,axiom,
! [X23] :
( pred_attacker(tuple_A_out_1(X23))
=> pred_attacker(X23) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax69) ).
fof(f71,axiom,
! [X24] :
( pred_attacker(X24)
=> pred_attacker(tuple_A_in_2(X24)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax70) ).
fof(f78,axiom,
pred_attacker(tuple_A_out_1(constr_comm_enc(name_m_9,name_Ka))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax77) ).
fof(f79,axiom,
! [X32] :
( pred_attacker(tuple_A_in_2(X32))
=> pred_attacker(tuple_A_out_3(constr_comm_dec(X32,name_Ka))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax78) ).
fof(f80,axiom,
! [X33] :
( pred_attacker(tuple_A_in_2(X33))
=> pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax79) ).
fof(f82,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
fof(f83,negated_conjecture,
~ pred_attacker(name_objective),
inference(negated_conjecture,[],[f82]) ).
fof(f84,plain,
! [X0,X1] : constr_comm_dec(constr_comm_enc(X1,X0),X0) = X1,
inference(rectify,[],[f47]) ).
fof(f86,plain,
! [X0,X1] :
( ( pred_attacker(X1)
& pred_attacker(X0) )
=> pred_attacker(constr_dec(X0,X1)) ),
inference(rectify,[],[f51]) ).
fof(f96,plain,
! [X0] :
( pred_attacker(tuple_A_out_4(X0))
=> pred_attacker(X0) ),
inference(rectify,[],[f66]) ).
fof(f98,plain,
! [X0] :
( pred_attacker(tuple_A_out_3(X0))
=> pred_attacker(X0) ),
inference(rectify,[],[f68]) ).
fof(f100,plain,
! [X0] :
( pred_attacker(tuple_A_out_1(X0))
=> pred_attacker(X0) ),
inference(rectify,[],[f70]) ).
fof(f101,plain,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_A_in_2(X0)) ),
inference(rectify,[],[f71]) ).
fof(f107,plain,
! [X0] :
( pred_attacker(tuple_A_in_2(X0))
=> pred_attacker(tuple_A_out_3(constr_comm_dec(X0,name_Ka))) ),
inference(rectify,[],[f79]) ).
fof(f108,plain,
! [X0] :
( pred_attacker(tuple_A_in_2(X0))
=> pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))) ),
inference(rectify,[],[f80]) ).
fof(f110,plain,
~ pred_attacker(name_objective),
inference(flattening,[],[f83]) ).
fof(f114,plain,
! [X0,X1] :
( pred_attacker(constr_dec(X0,X1))
| ~ pred_attacker(X1)
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f86]) ).
fof(f115,plain,
! [X0,X1] :
( pred_attacker(constr_dec(X0,X1))
| ~ pred_attacker(X1)
| ~ pred_attacker(X0) ),
inference(flattening,[],[f114]) ).
fof(f127,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_A_out_4(X0)) ),
inference(ennf_transformation,[],[f96]) ).
fof(f129,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_A_out_3(X0)) ),
inference(ennf_transformation,[],[f98]) ).
fof(f131,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_A_out_1(X0)) ),
inference(ennf_transformation,[],[f100]) ).
fof(f132,plain,
! [X0] :
( pred_attacker(tuple_A_in_2(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f101]) ).
fof(f138,plain,
! [X0] :
( pred_attacker(tuple_A_out_3(constr_comm_dec(X0,name_Ka)))
| ~ pred_attacker(tuple_A_in_2(X0)) ),
inference(ennf_transformation,[],[f107]) ).
fof(f139,plain,
! [X0] :
( pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9)))
| ~ pred_attacker(tuple_A_in_2(X0)) ),
inference(ennf_transformation,[],[f108]) ).
fof(f186,plain,
! [X0,X1] : constr_dec(constr_enc(X1,X0),X0) = X1,
inference(cnf_transformation,[],[f46]) ).
fof(f187,plain,
! [X0,X1] : constr_comm_dec(constr_comm_enc(X1,X0),X0) = X1,
inference(cnf_transformation,[],[f84]) ).
fof(f188,plain,
pred_attacker(tuple_true),
inference(cnf_transformation,[],[f48]) ).
fof(f191,plain,
! [X0,X1] :
( pred_attacker(constr_dec(X0,X1))
| ~ pred_attacker(X1)
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f206,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_A_out_4(X0)) ),
inference(cnf_transformation,[],[f127]) ).
fof(f208,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_A_out_3(X0)) ),
inference(cnf_transformation,[],[f129]) ).
fof(f210,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_A_out_1(X0)) ),
inference(cnf_transformation,[],[f131]) ).
fof(f211,plain,
! [X0] :
( pred_attacker(tuple_A_in_2(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f217,plain,
pred_attacker(tuple_A_out_1(constr_comm_enc(name_m_9,name_Ka))),
inference(cnf_transformation,[],[f78]) ).
fof(f218,plain,
! [X0] :
( pred_attacker(tuple_A_out_3(constr_comm_dec(X0,name_Ka)))
| ~ pred_attacker(tuple_A_in_2(X0)) ),
inference(cnf_transformation,[],[f138]) ).
fof(f219,plain,
! [X0] :
( pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9)))
| ~ pred_attacker(tuple_A_in_2(X0)) ),
inference(cnf_transformation,[],[f139]) ).
fof(f221,plain,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f110]) ).
cnf(c_94,plain,
constr_dec(constr_enc(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f186]) ).
cnf(c_95,plain,
constr_comm_dec(constr_comm_enc(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f187]) ).
cnf(c_96,plain,
pred_attacker(tuple_true),
inference(cnf_transformation,[],[f188]) ).
cnf(c_99,plain,
( ~ pred_attacker(X0)
| ~ pred_attacker(X1)
| pred_attacker(constr_dec(X1,X0)) ),
inference(cnf_transformation,[],[f191]) ).
cnf(c_114,plain,
( ~ pred_attacker(tuple_A_out_4(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f206]) ).
cnf(c_116,plain,
( ~ pred_attacker(tuple_A_out_3(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f208]) ).
cnf(c_118,plain,
( ~ pred_attacker(tuple_A_out_1(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f210]) ).
cnf(c_119,plain,
( ~ pred_attacker(X0)
| pred_attacker(tuple_A_in_2(X0)) ),
inference(cnf_transformation,[],[f211]) ).
cnf(c_125,plain,
pred_attacker(tuple_A_out_1(constr_comm_enc(name_m_9,name_Ka))),
inference(cnf_transformation,[],[f217]) ).
cnf(c_126,plain,
( ~ pred_attacker(tuple_A_in_2(X0))
| pred_attacker(tuple_A_out_3(constr_comm_dec(X0,name_Ka))) ),
inference(cnf_transformation,[],[f218]) ).
cnf(c_127,plain,
( ~ pred_attacker(tuple_A_in_2(X0))
| pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))) ),
inference(cnf_transformation,[],[f219]) ).
cnf(c_129,negated_conjecture,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f221]) ).
cnf(c_183,plain,
( ~ pred_attacker(X0)
| pred_attacker(tuple_A_out_3(constr_comm_dec(X0,name_Ka))) ),
inference(prop_impl_just,[status(thm)],[c_119,c_126]) ).
cnf(c_185,plain,
( ~ pred_attacker(X0)
| pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))) ),
inference(prop_impl_just,[status(thm)],[c_119,c_127]) ).
cnf(c_661,plain,
( ~ pred_attacker(X0)
| pred_attacker(tuple_A_out_3(constr_comm_dec(X0,name_Ka))) ),
inference(prop_impl_just,[status(thm)],[c_183]) ).
cnf(c_663,plain,
( ~ pred_attacker(X0)
| pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))) ),
inference(prop_impl_just,[status(thm)],[c_185]) ).
cnf(c_1079,negated_conjecture,
~ pred_attacker(name_objective),
inference(demodulation,[status(thm)],[c_129]) ).
cnf(c_1969,plain,
pred_attacker(tuple_A_out_4(constr_enc(name_objective,name_m_9))),
inference(superposition,[status(thm)],[c_96,c_663]) ).
cnf(c_2023,plain,
pred_attacker(constr_enc(name_objective,name_m_9)),
inference(superposition,[status(thm)],[c_1969,c_114]) ).
cnf(c_2033,plain,
( ~ pred_attacker(X0)
| pred_attacker(constr_comm_dec(X0,name_Ka)) ),
inference(superposition,[status(thm)],[c_661,c_116]) ).
cnf(c_2045,plain,
pred_attacker(constr_comm_enc(name_m_9,name_Ka)),
inference(superposition,[status(thm)],[c_125,c_118]) ).
cnf(c_2075,plain,
( ~ pred_attacker(constr_enc(X0,X1))
| ~ pred_attacker(X1)
| pred_attacker(X0) ),
inference(superposition,[status(thm)],[c_94,c_99]) ).
cnf(c_2083,plain,
( ~ pred_attacker(constr_comm_enc(X0,name_Ka))
| pred_attacker(X0) ),
inference(superposition,[status(thm)],[c_95,c_2033]) ).
cnf(c_2091,plain,
pred_attacker(name_m_9),
inference(superposition,[status(thm)],[c_2045,c_2083]) ).
cnf(c_2128,plain,
( ~ pred_attacker(name_m_9)
| pred_attacker(name_objective) ),
inference(superposition,[status(thm)],[c_2023,c_2075]) ).
cnf(c_2129,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2128,c_1079,c_2091]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SWW955+1 : TPTP v8.1.2. Released v7.4.0.
% 0.00/0.09 % Command : run_iprover %s %d THM
% 0.09/0.29 % Computer : n015.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Thu May 2 22:42:35 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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
% 2.77/1.07 % SZS status Started for theBenchmark.p
% 2.77/1.07 % SZS status Theorem for theBenchmark.p
% 2.77/1.07
% 2.77/1.07 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.77/1.07
% 2.77/1.07 ------ iProver source info
% 2.77/1.07
% 2.77/1.07 git: date: 2024-05-02 19:28:25 +0000
% 2.77/1.07 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.77/1.07 git: non_committed_changes: false
% 2.77/1.07
% 2.77/1.07 ------ Parsing...
% 2.77/1.07 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.77/1.07
% 2.77/1.07 ------ 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
% 2.77/1.07
% 2.77/1.07 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.77/1.07
% 2.77/1.07 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.77/1.07 ------ Proving...
% 2.77/1.07 ------ Problem Properties
% 2.77/1.07
% 2.77/1.07
% 2.77/1.07 clauses 79
% 2.77/1.07 conjectures 1
% 2.77/1.07 EPR 54
% 2.77/1.07 Horn 79
% 2.77/1.07 unary 58
% 2.77/1.07 binary 17
% 2.77/1.07 lits 104
% 2.77/1.07 lits eq 47
% 2.77/1.07 fd_pure 0
% 2.77/1.07 fd_pseudo 0
% 2.77/1.07 fd_cond 0
% 2.77/1.07 fd_pseudo_cond 0
% 2.77/1.07 AC symbols 0
% 2.77/1.07
% 2.77/1.07 ------ Schedule dynamic 5 is on
% 2.77/1.07
% 2.77/1.07 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.77/1.07
% 2.77/1.07
% 2.77/1.07 ------
% 2.77/1.07 Current options:
% 2.77/1.07 ------
% 2.77/1.07
% 2.77/1.07
% 2.77/1.07
% 2.77/1.07
% 2.77/1.07 ------ Proving...
% 2.77/1.07
% 2.77/1.07
% 2.77/1.07 % SZS status Theorem for theBenchmark.p
% 2.77/1.07
% 2.77/1.07 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.77/1.08
% 2.77/1.08
%------------------------------------------------------------------------------