TSTP Solution File: SWW951+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWW951+1 : TPTP v8.1.2. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n006.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:54 EDT 2024
% Result : Theorem 2.15s 1.14s
% Output : CNFRefutation 2.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 12 unt; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 57 ( 26 ~; 21 |; 2 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 27 ( 2 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f45,axiom,
pred_attacker(constr_ZERO),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax44) ).
fof(f47,axiom,
! [X11] :
( pred_attacker(tuple_T_out_4(X11))
=> pred_attacker(X11) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax46) ).
fof(f50,axiom,
! [X14] :
( pred_attacker(X14)
=> pred_attacker(tuple_T_in_3(X14)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax49) ).
fof(f52,axiom,
! [X16] :
( pred_attacker(X16)
=> pred_attacker(tuple_T_in_1(X16)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax51) ).
fof(f65,axiom,
! [X25,X26] :
( ( pred_attacker(tuple_T_in_1(X26))
& pred_attacker(tuple_T_in_3(X25)) )
=> pred_attacker(tuple_T_out_4(name_objective)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax64) ).
fof(f66,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
fof(f67,negated_conjecture,
~ pred_attacker(name_objective),
inference(negated_conjecture,[],[f66]) ).
fof(f74,plain,
! [X0] :
( pred_attacker(tuple_T_out_4(X0))
=> pred_attacker(X0) ),
inference(rectify,[],[f47]) ).
fof(f77,plain,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_T_in_3(X0)) ),
inference(rectify,[],[f50]) ).
fof(f79,plain,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_T_in_1(X0)) ),
inference(rectify,[],[f52]) ).
fof(f86,plain,
! [X0,X1] :
( ( pred_attacker(tuple_T_in_1(X1))
& pred_attacker(tuple_T_in_3(X0)) )
=> pred_attacker(tuple_T_out_4(name_objective)) ),
inference(rectify,[],[f65]) ).
fof(f87,plain,
~ pred_attacker(name_objective),
inference(flattening,[],[f67]) ).
fof(f93,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_T_out_4(X0)) ),
inference(ennf_transformation,[],[f74]) ).
fof(f96,plain,
! [X0] :
( pred_attacker(tuple_T_in_3(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f77]) ).
fof(f98,plain,
! [X0] :
( pred_attacker(tuple_T_in_1(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f79]) ).
fof(f105,plain,
! [X0,X1] :
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_1(X1))
| ~ pred_attacker(tuple_T_in_3(X0)) ),
inference(ennf_transformation,[],[f86]) ).
fof(f106,plain,
! [X0,X1] :
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_1(X1))
| ~ pred_attacker(tuple_T_in_3(X0)) ),
inference(flattening,[],[f105]) ).
fof(f151,plain,
pred_attacker(constr_ZERO),
inference(cnf_transformation,[],[f45]) ).
fof(f153,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_T_out_4(X0)) ),
inference(cnf_transformation,[],[f93]) ).
fof(f156,plain,
! [X0] :
( pred_attacker(tuple_T_in_3(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f96]) ).
fof(f158,plain,
! [X0] :
( pred_attacker(tuple_T_in_1(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f98]) ).
fof(f170,plain,
! [X0,X1] :
( pred_attacker(tuple_T_out_4(name_objective))
| ~ pred_attacker(tuple_T_in_1(X1))
| ~ pred_attacker(tuple_T_in_3(X0)) ),
inference(cnf_transformation,[],[f106]) ).
fof(f171,plain,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f87]) ).
cnf(c_93,plain,
pred_attacker(constr_ZERO),
inference(cnf_transformation,[],[f151]) ).
cnf(c_95,plain,
( ~ pred_attacker(tuple_T_out_4(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f153]) ).
cnf(c_98,plain,
( ~ pred_attacker(X0)
| pred_attacker(tuple_T_in_3(X0)) ),
inference(cnf_transformation,[],[f156]) ).
cnf(c_100,plain,
( ~ pred_attacker(X0)
| pred_attacker(tuple_T_in_1(X0)) ),
inference(cnf_transformation,[],[f158]) ).
cnf(c_112,plain,
( ~ pred_attacker(tuple_T_in_3(X0))
| ~ pred_attacker(tuple_T_in_1(X1))
| pred_attacker(tuple_T_out_4(name_objective)) ),
inference(cnf_transformation,[],[f170]) ).
cnf(c_113,negated_conjecture,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f171]) ).
cnf(c_115,plain,
( ~ pred_attacker(constr_ZERO)
| pred_attacker(tuple_T_in_1(constr_ZERO)) ),
inference(instantiation,[status(thm)],[c_100]) ).
cnf(c_116,plain,
( ~ pred_attacker(constr_ZERO)
| pred_attacker(tuple_T_in_3(constr_ZERO)) ),
inference(instantiation,[status(thm)],[c_98]) ).
cnf(c_125,plain,
( ~ pred_attacker(tuple_T_in_3(constr_ZERO))
| ~ pred_attacker(tuple_T_in_1(constr_ZERO))
| pred_attacker(tuple_T_out_4(name_objective)) ),
inference(instantiation,[status(thm)],[c_112]) ).
cnf(c_127,plain,
pred_attacker(tuple_T_out_4(name_objective)),
inference(global_subsumption_just,[status(thm)],[c_112,c_93,c_115,c_116,c_125]) ).
cnf(c_759,negated_conjecture,
~ pred_attacker(name_objective),
inference(demodulation,[status(thm)],[c_113]) ).
cnf(c_1401,plain,
pred_attacker(name_objective),
inference(superposition,[status(thm)],[c_127,c_95]) ).
cnf(c_1402,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1401,c_759]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW951+1 : TPTP v8.1.2. Released v7.4.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.11/0.34 % Computer : n006.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 300
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Thu May 2 22:16:04 EDT 2024
% 0.11/0.34 % CPUTime :
% 0.17/0.46 Running first-order theorem proving
% 0.17/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
% 2.15/1.14 % SZS status Started for theBenchmark.p
% 2.15/1.14 % SZS status Theorem for theBenchmark.p
% 2.15/1.14
% 2.15/1.14 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 2.15/1.14
% 2.15/1.14 ------ iProver source info
% 2.15/1.14
% 2.15/1.14 git: date: 2024-05-02 19:28:25 +0000
% 2.15/1.14 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 2.15/1.14 git: non_committed_changes: false
% 2.15/1.14
% 2.15/1.14 ------ Parsing...
% 2.15/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.15/1.14
% 2.15/1.14 ------ 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.15/1.14
% 2.15/1.14 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.15/1.14
% 2.15/1.14 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.15/1.14 ------ Proving...
% 2.15/1.14 ------ Problem Properties
% 2.15/1.14
% 2.15/1.14
% 2.15/1.14 clauses 63
% 2.15/1.14 conjectures 1
% 2.15/1.14 EPR 46
% 2.15/1.14 Horn 63
% 2.15/1.14 unary 52
% 2.15/1.14 binary 10
% 2.15/1.14 lits 75
% 2.15/1.14 lits eq 40
% 2.15/1.14 fd_pure 0
% 2.15/1.14 fd_pseudo 0
% 2.15/1.14 fd_cond 0
% 2.15/1.14 fd_pseudo_cond 0
% 2.15/1.14 AC symbols 1
% 2.15/1.14
% 2.15/1.14 ------ Schedule dynamic 5 is on
% 2.15/1.14
% 2.15/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.15/1.14
% 2.15/1.14
% 2.15/1.14 ------
% 2.15/1.14 Current options:
% 2.15/1.14 ------
% 2.15/1.14
% 2.15/1.14
% 2.15/1.14
% 2.15/1.14
% 2.15/1.14 ------ Proving...
% 2.15/1.14
% 2.15/1.14
% 2.15/1.14 % SZS status Theorem for theBenchmark.p
% 2.15/1.14
% 2.15/1.14 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.15/1.14
% 2.15/1.14
%------------------------------------------------------------------------------