%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV416+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 03:17:35 PM UTC 2026
% Result : Theorem 3.96s 1.21s
% Output : CNFRefutation 3.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 5 unt; 0 def)
% Number of atoms : 69 ( 16 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 67 ( 28 ~; 22 |; 9 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 58 ( 0 sgn 50 !; 8 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
fof(f56,axiom,
! [X0,X1] :
( pi_sharp_remove(X0,X1)
<=> contains_pq(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax',ax56) ).
fof(f57,axiom,
! [X0,X1] :
( pi_remove(X0,X1)
<=> pi_sharp_remove(i(X0),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax',ax57) ).
fof(f64,axiom,
! [X0,X1,X2,X3] :
( contains_pq(i(triple(X0,X1,X2)),X3)
=> i(remove_cpq(triple(X0,X1,X2),X3)) = remove_pq(i(triple(X0,X1,X2)),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main3_li34) ).
fof(f65,conjecture,
! [X0,X1,X2,X3] :
( pi_remove(triple(X0,X1,X2),X3)
=> ( phi(remove_cpq(triple(X0,X1,X2),X3))
=> ( i(remove_cpq(triple(X0,X1,X2),X3)) = remove_pq(i(triple(X0,X1,X2)),X3)
& pi_sharp_remove(i(triple(X0,X1,X2)),X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co3) ).
fof(f66,negated_conjecture,
~ ! [X0,X1,X2,X3] :
( pi_remove(triple(X0,X1,X2),X3)
=> ( phi(remove_cpq(triple(X0,X1,X2),X3))
=> ( i(remove_cpq(triple(X0,X1,X2),X3)) = remove_pq(i(triple(X0,X1,X2)),X3)
& pi_sharp_remove(i(triple(X0,X1,X2)),X3) ) ) ),
inference(negated_conjecture,[status(cth)],[f65]) ).
fof(f76,plain,
! [X0,X1] :
( pi_remove(X0,X1)
=> pi_sharp_remove(i(X0),X1) ),
inference(unused_predicate_definition_removal,[],[f57]) ).
fof(f78,plain,
! [X0,X1,X2,X3] :
( ~ contains_pq(i(triple(X0,X1,X2)),X3)
| i(remove_cpq(triple(X0,X1,X2),X3)) = remove_pq(i(triple(X0,X1,X2)),X3) ),
inference(ennf_transformation,[],[f64]) ).
fof(f79,plain,
? [X0,X1,X2,X3] :
( pi_remove(triple(X0,X1,X2),X3)
& phi(remove_cpq(triple(X0,X1,X2),X3))
& ( i(remove_cpq(triple(X0,X1,X2),X3)) != remove_pq(i(triple(X0,X1,X2)),X3)
| ~ pi_sharp_remove(i(triple(X0,X1,X2)),X3) ) ),
inference(ennf_transformation,[],[f66]) ).
fof(f80,plain,
? [X0,X1,X2,X3] :
( pi_remove(triple(X0,X1,X2),X3)
& phi(remove_cpq(triple(X0,X1,X2),X3))
& ( i(remove_cpq(triple(X0,X1,X2),X3)) != remove_pq(i(triple(X0,X1,X2)),X3)
| ~ pi_sharp_remove(i(triple(X0,X1,X2)),X3) ) ),
inference(flattening,[],[f79]) ).
fof(f85,plain,
! [X0,X1] :
( ~ pi_remove(X0,X1)
| pi_sharp_remove(i(X0),X1) ),
inference(ennf_transformation,[],[f76]) ).
fof(f106,plain,
( pi_remove(triple(sK0,sK1,sK2),sK3)
& phi(remove_cpq(triple(sK0,sK1,sK2),sK3))
& ( i(remove_cpq(triple(sK0,sK1,sK2),sK3)) != remove_pq(i(triple(sK0,sK1,sK2)),sK3)
| ~ pi_sharp_remove(i(triple(sK0,sK1,sK2)),sK3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f80]) ).
fof(f107,plain,
! [X0,X1] :
( ( ~ pi_sharp_remove(X0,X1)
| contains_pq(X0,X1) )
& ( ~ contains_pq(X0,X1)
| pi_sharp_remove(X0,X1) ) ),
inference(nnf_transformation,[],[f56]) ).
fof(f115,plain,
! [X2,X3,X0,X1] :
( ~ contains_pq(i(triple(X0,X1,X2)),X3)
| i(remove_cpq(triple(X0,X1,X2),X3)) = remove_pq(i(triple(X0,X1,X2)),X3) ),
inference(cnf_transformation,[],[f78]) ).
fof(f116,plain,
pi_remove(triple(sK0,sK1,sK2),sK3),
inference(cnf_transformation,[],[f106]) ).
fof(f118,plain,
( i(remove_cpq(triple(sK0,sK1,sK2),sK3)) != remove_pq(i(triple(sK0,sK1,sK2)),sK3)
| ~ pi_sharp_remove(i(triple(sK0,sK1,sK2)),sK3) ),
inference(cnf_transformation,[],[f106]) ).
fof(f124,plain,
! [X0,X1] :
( ~ pi_remove(X0,X1)
| pi_sharp_remove(i(X0),X1) ),
inference(cnf_transformation,[],[f85]) ).
fof(f125,plain,
! [X0,X1] :
( ~ pi_sharp_remove(X0,X1)
| contains_pq(X0,X1) ),
inference(cnf_transformation,[],[f107]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( i(remove_cpq(triple(X0,X1,X2),X3)) = remove_pq(i(triple(X0,X1,X2)),X3) )
| ~ contains_pq(i(triple(X0,X1,X2)),X3) ),
inference(cnf_transformation,[],[f115]) ).
tcf(c_51,negated_conjecture,
( ~ pi_sharp_remove(i(triple(sK0,sK1,sK2)),sK3)
| ( i(remove_cpq(triple(sK0,sK1,sK2),sK3)) != remove_pq(i(triple(sK0,sK1,sK2)),sK3) ) ),
inference(cnf_transformation,[],[f118]) ).
tcf(c_53,negated_conjecture,
pi_remove(triple(sK0,sK1,sK2),sK3),
inference(cnf_transformation,[],[f116]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( pi_sharp_remove(i(X0),X1)
| ~ pi_remove(X0,X1) ),
inference(cnf_transformation,[],[f124]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] :
( contains_pq(X0,X1)
| ~ pi_sharp_remove(X0,X1) ),
inference(cnf_transformation,[],[f125]) ).
tcf(c_140,plain,
! [X0: $i,X1: $i] :
( contains_pq(X0,X1)
| ~ pi_sharp_remove(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_61]) ).
tcf(c_152,plain,
! [X0: $i,X1: $i] :
( pi_sharp_remove(i(X0),X1)
| ~ pi_remove(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_59]) ).
tcf(c_631,plain,
! [X0: $i,X1: $i] :
( pi_sharp_remove(i(X0),X1)
| ( X1 != sK3 )
| ( triple(sK0,sK1,sK2) != X0 ) ),
inference(resolution_lifted,[status(thm)],[c_53,c_152]) ).
tcf(c_632,plain,
pi_sharp_remove(i(triple(sK0,sK1,sK2)),sK3),
inference(unflattening,[status(thm)],[c_631]) ).
tcf(c_738,plain,
! [X0: $i,X1: $i] :
( contains_pq(X0,X1)
| ( X1 != sK3 )
| ( i(triple(sK0,sK1,sK2)) != X0 ) ),
inference(resolution_lifted,[status(thm)],[c_632,c_140]) ).
tcf(c_739,plain,
contains_pq(i(triple(sK0,sK1,sK2)),sK3),
inference(unflattening,[status(thm)],[c_738]) ).
tcf(c_2157,plain,
( ( i(remove_cpq(triple(sK0,sK1,sK2),sK3)) = remove_pq(i(triple(sK0,sK1,sK2)),sK3) )
| ~ contains_pq(i(triple(sK0,sK1,sK2)),sK3) ),
inference(instantiation,[status(thm)],[c_50]) ).
tcf(c_2158,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_2157,c_739,c_632,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV416+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n004.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 19:31:21 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.41
% 0.14/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.41
% 0.14/0.41 % Detected problem language: tptp
% 0.14/0.43 % Proving...
% 3.96/1.21 % SZS status Started for theBenchmark.p
% 3.96/1.21 % SZS status Theorem for theBenchmark.p
% 3.96/1.21
% 3.96/1.21 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.96/1.21
% 3.96/1.21 % ------ iProver source info
% 3.96/1.21
% 3.96/1.21 % git: date: 2026-07-19 20:42:38 +0200
% 3.96/1.21 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.96/1.21 % git: non_committed_changes: false
% 3.96/1.21
% 3.96/1.21 % ------ Parsing...
% 3.96/1.21 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.96/1.21
% 3.96/1.21 % ------ Preprocessing... sup_sim: 0 sf_s rm: 6 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 6 0s sf_e pe_s pe_e %
% 3.96/1.21
% 3.96/1.21 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.96/1.21
% 3.96/1.21 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.96/1.21 % ------ Proving...
% 3.96/1.21 % ------ Problem Properties
% 3.96/1.21
% 3.96/1.21 %
% 3.96/1.21 % clauses 40
% 3.96/1.21 % conjectures 0
% 3.96/1.21 % EPR 4
% 3.96/1.21 % Horn 27
% 3.96/1.21 % unary 19
% 3.96/1.21 % binary 12
% 3.96/1.21 % lits 71
% 3.96/1.21 % lits eq 30
% 3.96/1.21 % fd_pure 0
% 3.96/1.21 % fd_pseudo 0
% 3.96/1.21 % fd_cond 6
% 3.96/1.21 % fd_pseudo_cond 4
% 3.96/1.21 % AC symbols 0
% 3.96/1.21
% 3.96/1.21 % ------ Schedule dynamic 5 is on
% 3.96/1.21
% 3.96/1.21 % ------ no conjectures: strip conj schedule
% 3.96/1.21
% 3.96/1.21 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.96/1.21
% 3.96/1.21
% 3.96/1.21 % ------
% 3.96/1.21 % Current options:
% 3.96/1.21 % ------
% 3.96/1.21
% 3.96/1.21
% 3.96/1.21 %
% 3.96/1.21
% 3.96/1.21 % ------ Proving...
% 3.96/1.21 %
% 3.96/1.21
% 3.96/1.21 % SZS status Theorem for theBenchmark.p
% 3.96/1.21
% 3.96/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.96/1.21
% 3.96/1.21
%------------------------------------------------------------------------------