TSTP Solution File: SWW956+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWW956+1 : TPTP v8.2.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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 18:18:58 EDT 2024
% Result : Theorem 2.93s 1.11s
% Output : CNFRefutation 2.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 56 ( 19 unt; 0 def)
% Number of atoms : 101 ( 3 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 83 ( 38 ~; 31 |; 2 &)
% ( 0 <=>; 12 =>; 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 : 12 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 55 ( 1 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f56,axiom,
! [X0,X1] : constr_dec(constr_enc(X1,X0),X0) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax55) ).
fof(f63,axiom,
! [X12,X13] :
( ( pred_attacker(X13)
& pred_attacker(X12) )
=> pred_attacker(constr_dec(X12,X13)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax62) ).
fof(f77,axiom,
! [X25] :
( pred_attacker(tuple_A_out_4(X25))
=> pred_attacker(X25) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax76) ).
fof(f79,axiom,
! [X27] :
( pred_attacker(tuple_A_out_2(X27))
=> pred_attacker(X27) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax78) ).
fof(f82,axiom,
! [X32,X33] :
( pred_attacker(tuple_A_out_1(X32,X33))
=> pred_attacker(X33) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax81) ).
fof(f83,axiom,
! [X34] :
( pred_attacker(X34)
=> pred_attacker(tuple_A_in_3(X34)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax82) ).
fof(f90,axiom,
pred_attacker(tuple_A_out_1(name_P_7,name_G_8)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax89) ).
fof(f91,axiom,
pred_attacker(tuple_A_out_2(constr_mod(constr_exp(name_G_8,name_Na),name_P_7))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax90) ).
fof(f92,axiom,
! [X42] :
( pred_attacker(tuple_A_in_3(X42))
=> pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(X42,name_Na),name_P_7)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax91) ).
fof(f94,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
fof(f95,negated_conjecture,
~ pred_attacker(name_objective),
inference(negated_conjecture,[],[f94]) ).
fof(f100,plain,
! [X0,X1] :
( ( pred_attacker(X1)
& pred_attacker(X0) )
=> pred_attacker(constr_dec(X0,X1)) ),
inference(rectify,[],[f63]) ).
fof(f109,plain,
! [X0] :
( pred_attacker(tuple_A_out_4(X0))
=> pred_attacker(X0) ),
inference(rectify,[],[f77]) ).
fof(f111,plain,
! [X0] :
( pred_attacker(tuple_A_out_2(X0))
=> pred_attacker(X0) ),
inference(rectify,[],[f79]) ).
fof(f114,plain,
! [X0,X1] :
( pred_attacker(tuple_A_out_1(X0,X1))
=> pred_attacker(X1) ),
inference(rectify,[],[f82]) ).
fof(f115,plain,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_A_in_3(X0)) ),
inference(rectify,[],[f83]) ).
fof(f121,plain,
! [X0] :
( pred_attacker(tuple_A_in_3(X0))
=> pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(X0,name_Na),name_P_7)))) ),
inference(rectify,[],[f92]) ).
fof(f123,plain,
~ pred_attacker(name_objective),
inference(flattening,[],[f95]) ).
fof(f131,plain,
! [X0,X1] :
( pred_attacker(constr_dec(X0,X1))
| ~ pred_attacker(X1)
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f100]) ).
fof(f132,plain,
! [X0,X1] :
( pred_attacker(constr_dec(X0,X1))
| ~ pred_attacker(X1)
| ~ pred_attacker(X0) ),
inference(flattening,[],[f131]) ).
fof(f142,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_A_out_4(X0)) ),
inference(ennf_transformation,[],[f109]) ).
fof(f144,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_A_out_2(X0)) ),
inference(ennf_transformation,[],[f111]) ).
fof(f148,plain,
! [X0,X1] :
( pred_attacker(X1)
| ~ pred_attacker(tuple_A_out_1(X0,X1)) ),
inference(ennf_transformation,[],[f114]) ).
fof(f149,plain,
! [X0] :
( pred_attacker(tuple_A_in_3(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f115]) ).
fof(f155,plain,
! [X0] :
( pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(X0,name_Na),name_P_7))))
| ~ pred_attacker(tuple_A_in_3(X0)) ),
inference(ennf_transformation,[],[f121]) ).
fof(f213,plain,
! [X0,X1] : constr_dec(constr_enc(X1,X0),X0) = X1,
inference(cnf_transformation,[],[f56]) ).
fof(f220,plain,
! [X0,X1] :
( pred_attacker(constr_dec(X0,X1))
| ~ pred_attacker(X1)
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f234,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_A_out_4(X0)) ),
inference(cnf_transformation,[],[f142]) ).
fof(f236,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_A_out_2(X0)) ),
inference(cnf_transformation,[],[f144]) ).
fof(f239,plain,
! [X0,X1] :
( pred_attacker(X1)
| ~ pred_attacker(tuple_A_out_1(X0,X1)) ),
inference(cnf_transformation,[],[f148]) ).
fof(f240,plain,
! [X0] :
( pred_attacker(tuple_A_in_3(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f246,plain,
pred_attacker(tuple_A_out_1(name_P_7,name_G_8)),
inference(cnf_transformation,[],[f90]) ).
fof(f247,plain,
pred_attacker(tuple_A_out_2(constr_mod(constr_exp(name_G_8,name_Na),name_P_7))),
inference(cnf_transformation,[],[f91]) ).
fof(f248,plain,
! [X0] :
( pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(X0,name_Na),name_P_7))))
| ~ pred_attacker(tuple_A_in_3(X0)) ),
inference(cnf_transformation,[],[f155]) ).
fof(f250,plain,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f123]) ).
cnf(c_104,plain,
constr_dec(constr_enc(X0,X1),X1) = X0,
inference(cnf_transformation,[],[f213]) ).
cnf(c_111,plain,
( ~ pred_attacker(X0)
| ~ pred_attacker(X1)
| pred_attacker(constr_dec(X1,X0)) ),
inference(cnf_transformation,[],[f220]) ).
cnf(c_125,plain,
( ~ pred_attacker(tuple_A_out_4(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f234]) ).
cnf(c_127,plain,
( ~ pred_attacker(tuple_A_out_2(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f236]) ).
cnf(c_130,plain,
( ~ pred_attacker(tuple_A_out_1(X0,X1))
| pred_attacker(X1) ),
inference(cnf_transformation,[],[f239]) ).
cnf(c_131,plain,
( ~ pred_attacker(X0)
| pred_attacker(tuple_A_in_3(X0)) ),
inference(cnf_transformation,[],[f240]) ).
cnf(c_137,plain,
pred_attacker(tuple_A_out_1(name_P_7,name_G_8)),
inference(cnf_transformation,[],[f246]) ).
cnf(c_138,plain,
pred_attacker(tuple_A_out_2(constr_mod(constr_exp(name_G_8,name_Na),name_P_7))),
inference(cnf_transformation,[],[f247]) ).
cnf(c_139,plain,
( ~ pred_attacker(tuple_A_in_3(X0))
| pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(X0,name_Na),name_P_7)))) ),
inference(cnf_transformation,[],[f248]) ).
cnf(c_141,negated_conjecture,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f250]) ).
cnf(c_186,plain,
( ~ pred_attacker(X0)
| pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(X0,name_Na),name_P_7)))) ),
inference(prop_impl_just,[status(thm)],[c_131,c_139]) ).
cnf(c_711,plain,
( ~ pred_attacker(X0)
| pred_attacker(tuple_A_out_4(constr_enc(name_objective,constr_mod(constr_exp(X0,name_Na),name_P_7)))) ),
inference(prop_impl_just,[status(thm)],[c_186]) ).
cnf(c_1190,negated_conjecture,
~ pred_attacker(name_objective),
inference(demodulation,[status(thm)],[c_141]) ).
cnf(c_2210,plain,
( ~ pred_attacker(X0)
| pred_attacker(constr_enc(name_objective,constr_mod(constr_exp(X0,name_Na),name_P_7))) ),
inference(superposition,[status(thm)],[c_711,c_125]) ).
cnf(c_2284,plain,
pred_attacker(name_G_8),
inference(superposition,[status(thm)],[c_137,c_130]) ).
cnf(c_2285,plain,
pred_attacker(constr_mod(constr_exp(name_G_8,name_Na),name_P_7)),
inference(superposition,[status(thm)],[c_138,c_127]) ).
cnf(c_2326,plain,
( ~ pred_attacker(constr_enc(X0,X1))
| ~ pred_attacker(X1)
| pred_attacker(X0) ),
inference(superposition,[status(thm)],[c_104,c_111]) ).
cnf(c_2353,plain,
( ~ pred_attacker(constr_mod(constr_exp(X0,name_Na),name_P_7))
| ~ pred_attacker(X0)
| pred_attacker(name_objective) ),
inference(superposition,[status(thm)],[c_2210,c_2326]) ).
cnf(c_2354,plain,
( ~ pred_attacker(constr_mod(constr_exp(X0,name_Na),name_P_7))
| ~ pred_attacker(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2353,c_1190]) ).
cnf(c_2363,plain,
~ pred_attacker(name_G_8),
inference(superposition,[status(thm)],[c_2285,c_2354]) ).
cnf(c_2366,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2363,c_2284]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWW956+1 : TPTP v8.2.0. Released v7.4.0.
% 0.04/0.12 % Command : run_iprover %s %d THM
% 0.10/0.32 % Computer : n023.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Wed Jun 19 04:43:39 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.18/0.44 Running first-order theorem proving
% 0.18/0.44 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.93/1.11 % SZS status Started for theBenchmark.p
% 2.93/1.11 % SZS status Theorem for theBenchmark.p
% 2.93/1.11
% 2.93/1.11 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.93/1.11
% 2.93/1.11 ------ iProver source info
% 2.93/1.11
% 2.93/1.11 git: date: 2024-06-12 09:56:46 +0000
% 2.93/1.11 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 2.93/1.11 git: non_committed_changes: false
% 2.93/1.11
% 2.93/1.11 ------ Parsing...
% 2.93/1.11 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.93/1.11
% 2.93/1.11 ------ 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.93/1.11
% 2.93/1.11 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.93/1.11
% 2.93/1.11 ------ Preprocessing... sf_s rm: 3 0s sf_e sf_s rm: 0 0s sf_e
% 2.93/1.11 ------ Proving...
% 2.93/1.11 ------ Problem Properties
% 2.93/1.11
% 2.93/1.11
% 2.93/1.11 clauses 93
% 2.93/1.11 conjectures 1
% 2.93/1.11 EPR 65
% 2.93/1.11 Horn 92
% 2.93/1.11 unary 69
% 2.93/1.11 binary 17
% 2.93/1.11 lits 124
% 2.93/1.11 lits eq 57
% 2.93/1.11 fd_pure 0
% 2.93/1.11 fd_pseudo 0
% 2.93/1.11 fd_cond 0
% 2.93/1.11 fd_pseudo_cond 0
% 2.93/1.11 AC symbols 0
% 2.93/1.11
% 2.93/1.11 ------ Schedule dynamic 5 is on
% 2.93/1.11
% 2.93/1.11 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.93/1.11
% 2.93/1.11
% 2.93/1.11 ------
% 2.93/1.11 Current options:
% 2.93/1.11 ------
% 2.93/1.11
% 2.93/1.11
% 2.93/1.11
% 2.93/1.11
% 2.93/1.11 ------ Proving...
% 2.93/1.11
% 2.93/1.11
% 2.93/1.11 % SZS status Theorem for theBenchmark.p
% 2.93/1.11
% 2.93/1.11 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.93/1.12
% 2.93/1.12
%------------------------------------------------------------------------------