TSTP Solution File: SWW950+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWW950+1 : TPTP v8.1.2. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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:32 EDT 2023
% Result : Theorem 0.47s 1.15s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 56 ( 11 unt; 0 def)
% Number of atoms : 114 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 106 ( 48 ~; 42 |; 4 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 51 ( 2 sgn; 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f54,axiom,
pred_attacker(constr_ZERO),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax53) ).
fof(f56,axiom,
! [X11] :
( pred_attacker(tuple_T_out_4(X11))
=> pred_attacker(X11) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax55) ).
fof(f58,axiom,
! [X13] :
( pred_attacker(tuple_T_out_2(X13))
=> pred_attacker(X13) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax57) ).
fof(f59,axiom,
! [X14,X15] :
( ( pred_attacker(X15)
& pred_attacker(X14) )
=> pred_attacker(tuple_T_in_3(X14,X15)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax58) ).
fof(f62,axiom,
! [X20] :
( pred_attacker(X20)
=> pred_attacker(tuple_T_in_1(X20)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax61) ).
fof(f74,axiom,
! [X28] :
( pred_attacker(tuple_T_in_1(X28))
=> pred_attacker(tuple_T_out_2(constr_h(constr_xor(X28,constr_xor(name_k0x30,name_ki))))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax73) ).
fof(f75,axiom,
! [X29,X30] :
( ( pred_attacker(tuple_T_in_1(X30))
& pred_attacker(tuple_T_in_3(X29,constr_h(constr_xor(X29,constr_xor(name_k0x30,name_ki))))) )
=> pred_attacker(tuple_T_out_4(name_objective)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax74) ).
fof(f76,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co0) ).
fof(f77,negated_conjecture,
~ pred_attacker(name_objective),
inference(negated_conjecture,[],[f76]) ).
fof(f84,plain,
! [X0] :
( pred_attacker(tuple_T_out_4(X0))
=> pred_attacker(X0) ),
inference(rectify,[],[f56]) ).
fof(f86,plain,
! [X0] :
( pred_attacker(tuple_T_out_2(X0))
=> pred_attacker(X0) ),
inference(rectify,[],[f58]) ).
fof(f87,plain,
! [X0,X1] :
( ( pred_attacker(X1)
& pred_attacker(X0) )
=> pred_attacker(tuple_T_in_3(X0,X1)) ),
inference(rectify,[],[f59]) ).
fof(f90,plain,
! [X0] :
( pred_attacker(X0)
=> pred_attacker(tuple_T_in_1(X0)) ),
inference(rectify,[],[f62]) ).
fof(f96,plain,
! [X0] :
( pred_attacker(tuple_T_in_1(X0))
=> pred_attacker(tuple_T_out_2(constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki))))) ),
inference(rectify,[],[f74]) ).
fof(f97,plain,
! [X0,X1] :
( ( pred_attacker(tuple_T_in_1(X1))
& pred_attacker(tuple_T_in_3(X0,constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki))))) )
=> pred_attacker(tuple_T_out_4(name_objective)) ),
inference(rectify,[],[f75]) ).
fof(f98,plain,
~ pred_attacker(name_objective),
inference(flattening,[],[f77]) ).
fof(f104,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_T_out_4(X0)) ),
inference(ennf_transformation,[],[f84]) ).
fof(f106,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_T_out_2(X0)) ),
inference(ennf_transformation,[],[f86]) ).
fof(f107,plain,
! [X0,X1] :
( pred_attacker(tuple_T_in_3(X0,X1))
| ~ pred_attacker(X1)
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f87]) ).
fof(f108,plain,
! [X0,X1] :
( pred_attacker(tuple_T_in_3(X0,X1))
| ~ pred_attacker(X1)
| ~ pred_attacker(X0) ),
inference(flattening,[],[f107]) ).
fof(f111,plain,
! [X0] :
( pred_attacker(tuple_T_in_1(X0))
| ~ pred_attacker(X0) ),
inference(ennf_transformation,[],[f90]) ).
fof(f117,plain,
! [X0] :
( pred_attacker(tuple_T_out_2(constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki)))))
| ~ pred_attacker(tuple_T_in_1(X0)) ),
inference(ennf_transformation,[],[f96]) ).
fof(f118,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,constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki))))) ),
inference(ennf_transformation,[],[f97]) ).
fof(f119,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,constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki))))) ),
inference(flattening,[],[f118]) ).
fof(f173,plain,
pred_attacker(constr_ZERO),
inference(cnf_transformation,[],[f54]) ).
fof(f175,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_T_out_4(X0)) ),
inference(cnf_transformation,[],[f104]) ).
fof(f177,plain,
! [X0] :
( pred_attacker(X0)
| ~ pred_attacker(tuple_T_out_2(X0)) ),
inference(cnf_transformation,[],[f106]) ).
fof(f178,plain,
! [X0,X1] :
( pred_attacker(tuple_T_in_3(X0,X1))
| ~ pred_attacker(X1)
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f108]) ).
fof(f181,plain,
! [X0] :
( pred_attacker(tuple_T_in_1(X0))
| ~ pred_attacker(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f192,plain,
! [X0] :
( pred_attacker(tuple_T_out_2(constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki)))))
| ~ pred_attacker(tuple_T_in_1(X0)) ),
inference(cnf_transformation,[],[f117]) ).
fof(f193,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,constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki))))) ),
inference(cnf_transformation,[],[f119]) ).
fof(f194,plain,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f98]) ).
cnf(c_102,plain,
pred_attacker(constr_ZERO),
inference(cnf_transformation,[],[f173]) ).
cnf(c_104,plain,
( ~ pred_attacker(tuple_T_out_4(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f175]) ).
cnf(c_106,plain,
( ~ pred_attacker(tuple_T_out_2(X0))
| pred_attacker(X0) ),
inference(cnf_transformation,[],[f177]) ).
cnf(c_107,plain,
( ~ pred_attacker(X0)
| ~ pred_attacker(X1)
| pred_attacker(tuple_T_in_3(X0,X1)) ),
inference(cnf_transformation,[],[f178]) ).
cnf(c_110,plain,
( ~ pred_attacker(X0)
| pred_attacker(tuple_T_in_1(X0)) ),
inference(cnf_transformation,[],[f181]) ).
cnf(c_121,plain,
( ~ pred_attacker(tuple_T_in_1(X0))
| pred_attacker(tuple_T_out_2(constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki))))) ),
inference(cnf_transformation,[],[f192]) ).
cnf(c_122,plain,
( ~ pred_attacker(tuple_T_in_3(X0,constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki)))))
| ~ pred_attacker(tuple_T_in_1(X1))
| pred_attacker(tuple_T_out_4(name_objective)) ),
inference(cnf_transformation,[],[f193]) ).
cnf(c_123,negated_conjecture,
~ pred_attacker(name_objective),
inference(cnf_transformation,[],[f194]) ).
cnf(c_125,plain,
( ~ pred_attacker(constr_ZERO)
| pred_attacker(tuple_T_in_1(constr_ZERO)) ),
inference(instantiation,[status(thm)],[c_110]) ).
cnf(c_153,plain,
( ~ pred_attacker(X0)
| pred_attacker(tuple_T_out_2(constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki))))) ),
inference(prop_impl_just,[status(thm)],[c_110,c_121]) ).
cnf(c_537,plain,
( ~ pred_attacker(X0)
| pred_attacker(tuple_T_out_2(constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki))))) ),
inference(prop_impl_just,[status(thm)],[c_153]) ).
cnf(c_876,plain,
( ~ pred_attacker(tuple_T_in_1(X0))
| ~ sP0_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_122]) ).
cnf(c_877,plain,
( ~ pred_attacker(tuple_T_in_3(X0,constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki)))))
| ~ sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split])],[c_122]) ).
cnf(c_878,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| sP0_iProver_split
| sP1_iProver_split ),
inference(splitting,[splitting(split),new_symbols(definition,[])],[c_122]) ).
cnf(c_894,plain,
( ~ pred_attacker(tuple_T_in_1(constr_ZERO))
| ~ sP0_iProver_split ),
inference(instantiation,[status(thm)],[c_876]) ).
cnf(c_1637,plain,
( pred_attacker(tuple_T_out_4(name_objective))
| sP1_iProver_split ),
inference(global_subsumption_just,[status(thm)],[c_878,c_102,c_125,c_894,c_878]) ).
cnf(c_1663,plain,
( pred_attacker(name_objective)
| sP1_iProver_split ),
inference(superposition,[status(thm)],[c_1637,c_104]) ).
cnf(c_1664,plain,
sP1_iProver_split,
inference(forward_subsumption_resolution,[status(thm)],[c_1663,c_123]) ).
cnf(c_1674,plain,
( ~ pred_attacker(X0)
| pred_attacker(constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki)))) ),
inference(superposition,[status(thm)],[c_537,c_106]) ).
cnf(c_1677,plain,
( ~ pred_attacker(constr_ZERO)
| pred_attacker(constr_h(constr_xor(constr_ZERO,constr_xor(name_k0x30,name_ki)))) ),
inference(instantiation,[status(thm)],[c_1674]) ).
cnf(c_1917,plain,
~ pred_attacker(tuple_T_in_3(X0,constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki))))),
inference(global_subsumption_just,[status(thm)],[c_877,c_877,c_1664]) ).
cnf(c_1920,plain,
( ~ pred_attacker(constr_h(constr_xor(X0,constr_xor(name_k0x30,name_ki))))
| ~ pred_attacker(X0) ),
inference(superposition,[status(thm)],[c_107,c_1917]) ).
cnf(c_1931,plain,
( ~ pred_attacker(constr_h(constr_xor(constr_ZERO,constr_xor(name_k0x30,name_ki))))
| ~ pred_attacker(constr_ZERO) ),
inference(instantiation,[status(thm)],[c_1920]) ).
cnf(c_1932,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1931,c_1677,c_102]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWW950+1 : TPTP v8.1.2. Released v7.4.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n011.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun Aug 27 18:22:25 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.47/1.15 % SZS status Started for theBenchmark.p
% 0.47/1.15 % SZS status Theorem for theBenchmark.p
% 0.47/1.15
% 0.47/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.47/1.15
% 0.47/1.15 ------ iProver source info
% 0.47/1.15
% 0.47/1.15 git: date: 2023-05-31 18:12:56 +0000
% 0.47/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.47/1.15 git: non_committed_changes: false
% 0.47/1.15 git: last_make_outside_of_git: false
% 0.47/1.15
% 0.47/1.15 ------ Parsing...
% 0.47/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.47/1.15
% 0.47/1.15 ------ 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
% 0.47/1.15
% 0.47/1.15 ------ Preprocessing... gs_s sp: 2 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.47/1.15
% 0.47/1.15 ------ Preprocessing... sf_s rm: 2 0s sf_e sf_s rm: 0 0s sf_e
% 0.47/1.15 ------ Proving...
% 0.47/1.15 ------ Problem Properties
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15 clauses 75
% 0.47/1.15 conjectures 1
% 0.47/1.15 EPR 55
% 0.47/1.15 Horn 74
% 0.47/1.15 unary 60
% 0.47/1.15 binary 12
% 0.47/1.15 lits 93
% 0.47/1.15 lits eq 49
% 0.47/1.15 fd_pure 0
% 0.47/1.15 fd_pseudo 0
% 0.47/1.15 fd_cond 0
% 0.47/1.15 fd_pseudo_cond 0
% 0.47/1.15 AC symbols 1
% 0.47/1.15
% 0.47/1.15 ------ Schedule dynamic 5 is on
% 0.47/1.15
% 0.47/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15 ------
% 0.47/1.15 Current options:
% 0.47/1.15 ------
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15 ------ Proving...
% 0.47/1.15
% 0.47/1.15
% 0.47/1.15 % SZS status Theorem for theBenchmark.p
% 0.47/1.15
% 0.47/1.15 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.47/1.15
% 0.47/1.16
%------------------------------------------------------------------------------