%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV367+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 : n011.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:28 PM UTC 2026
% Result : Theorem 3.05s 16.38s
% Output : CNFRefutation 3.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 10 unt; 0 def)
% Number of atoms : 18 ( 7 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 0 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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 : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 18 ( 0 sgn 15 !; 3 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
! [X0] : ~ contains_pq(create_pq,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+1.ax',ax8) ).
fof(f54,axiom,
! [X0,X1] : i(triple(X0,create_slb,X1)) = create_pq,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax',ax54) ).
fof(f63,conjecture,
! [X0,X1,X2] :
( contains_pq(i(triple(X0,create_slb,X1)),X2)
=> i(remove_cpq(triple(X0,create_slb,X1),X2)) = remove_pq(i(triple(X0,create_slb,X1)),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l3_co) ).
fof(f64,negated_conjecture,
~ ! [X0,X1,X2] :
( contains_pq(i(triple(X0,create_slb,X1)),X2)
=> i(remove_cpq(triple(X0,create_slb,X1),X2)) = remove_pq(i(triple(X0,create_slb,X1)),X2) ),
inference(negated_conjecture,[status(cth)],[f63]) ).
fof(f115,plain,
? [X0,X1,X2] :
( contains_pq(i(triple(X0,create_slb,X1)),X2)
& i(remove_cpq(triple(X0,create_slb,X1),X2)) != remove_pq(i(triple(X0,create_slb,X1)),X2) ),
inference(ennf_transformation,[],[f64]) ).
fof(f125,plain,
( contains_pq(i(triple(sK1,create_slb,sK2)),sK3)
& i(remove_cpq(triple(sK1,create_slb,sK2),sK3)) != remove_pq(i(triple(sK1,create_slb,sK2)),sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3)],[f115]) ).
fof(f133,plain,
! [X0] : ~ contains_pq(create_pq,X0),
inference(cnf_transformation,[],[f8]) ).
fof(f189,plain,
! [X0,X1] : create_pq = i(triple(X0,create_slb,X1)),
inference(cnf_transformation,[],[f54]) ).
fof(f191,plain,
contains_pq(i(triple(sK1,create_slb,sK2)),sK3),
inference(cnf_transformation,[],[f125]) ).
tcf(c_56,plain,
! [X0: $i] : ~ contains_pq(create_pq,X0),
inference(cnf_transformation,[],[f133]) ).
tcf(c_110,plain,
! [X0: $i,X1: $i] : i(triple(X0,create_slb,X1)) = create_pq,
inference(cnf_transformation,[],[f189]) ).
tcf(c_113,negated_conjecture,
contains_pq(i(triple(sK1,create_slb,sK2)),sK3),
inference(cnf_transformation,[],[f191]) ).
tcf(c_419,plain,
contains_pq(create_pq,sK3),
inference(demodulation,[status(thm)],[c_113,c_110]) ).
tcf(c_420,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_419,c_56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV367+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.16/15.46 % Computer : n011.cluster.edu
% 0.16/15.46 % Model : x86_64 x86_64
% 0.16/15.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/15.46 % Memory : 8046.5625MB
% 0.16/15.46 % OS : Linux 6.8.0-71-generic
% 0.16/15.46 % CPULimit : 300
% 0.16/15.46 % WCLimit : 300
% 0.16/15.46 % DateTime : Thu Sep 24 19:23:13 UTC 2026
% 0.16/15.46 % CPUTime :
% 0.16/15.46 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.21/15.50 Running first-order theorem proving
% 0.21/15.50 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.21/15.52
% 0.21/15.52 % ======== iProver multi-core TPTP/SMT =========
% 0.21/15.52
% 0.21/15.52 % Detected problem language: tptp
% 0.21/15.53 % Proving...
% 3.05/16.38 % SZS status Started for theBenchmark.p
% 3.05/16.38 % SZS status Theorem for theBenchmark.p
% 3.05/16.38
% 3.05/16.38 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.05/16.38
% 3.05/16.38 % ------ iProver source info
% 3.05/16.38
% 3.05/16.38 % git: date: 2026-07-19 20:42:38 +0200
% 3.05/16.38 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.05/16.38 % git: non_committed_changes: false
% 3.05/16.38
% 3.05/16.38 % ------ Parsing...
% 3.05/16.38 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.05/16.38
% 3.05/16.38 % ------ Preprocessing...%
% 3.05/16.38
% 3.05/16.38 % SZS status Theorem for theBenchmark.p
% 3.05/16.38
% 3.05/16.38 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.05/16.38
% 3.05/16.38
%------------------------------------------------------------------------------