%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SEU129+2 : 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 : n013.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 02:55:30 PM UTC 2026
% Result : Theorem 3.60s 11.50s
% Output : CNFRefutation 3.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 15 unt; 0 def)
% Number of atoms : 57 ( 3 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 53 ( 27 ~; 18 |; 4 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 56 ( 0 sgn 53 !; 3 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(f23,axiom,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t17_xboole_1) ).
fof(f24,axiom,
! [X0,X1,X2] :
( ( subset(X0,X2)
& subset(X0,X1) )
=> subset(X0,set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t19_xboole_1) ).
fof(f26,axiom,
! [X0,X1,X2] :
( ( subset(X1,X2)
& subset(X0,X1) )
=> subset(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(f27,conjecture,
! [X0,X1,X2] :
( subset(X0,X1)
=> subset(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_xboole_1) ).
fof(f28,negated_conjecture,
~ ! [X0,X1,X2] :
( subset(X0,X1)
=> subset(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
inference(negated_conjecture,[status(cth)],[f27]) ).
fof(f45,plain,
! [X0,X1,X2] :
( ~ subset(X0,X2)
| ~ subset(X0,X1)
| subset(X0,set_intersection2(X1,X2)) ),
inference(ennf_transformation,[],[f24]) ).
fof(f46,plain,
! [X0,X1,X2] :
( ~ subset(X0,X2)
| ~ subset(X0,X1)
| subset(X0,set_intersection2(X1,X2)) ),
inference(flattening,[],[f45]) ).
fof(f47,plain,
! [X0,X1,X2] :
( ~ subset(X1,X2)
| ~ subset(X0,X1)
| subset(X0,X2) ),
inference(ennf_transformation,[],[f26]) ).
fof(f48,plain,
! [X0,X1,X2] :
( ~ subset(X1,X2)
| ~ subset(X0,X1)
| subset(X0,X2) ),
inference(flattening,[],[f47]) ).
fof(f49,plain,
? [X0,X1,X2] :
( subset(X0,X1)
& ~ subset(set_intersection2(X0,X2),set_intersection2(X1,X2)) ),
inference(ennf_transformation,[],[f28]) ).
fof(f63,plain,
( subset(sK0,sK1)
& ~ subset(set_intersection2(sK0,sK2),set_intersection2(sK1,sK2)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f49]) ).
fof(f86,plain,
! [X0,X1] : subset(set_intersection2(X0,X1),X0),
inference(cnf_transformation,[],[f23]) ).
fof(f87,plain,
! [X2,X0,X1] :
( ~ subset(X0,X2)
| ~ subset(X0,X1)
| subset(X0,set_intersection2(X1,X2)) ),
inference(cnf_transformation,[],[f46]) ).
fof(f88,plain,
! [X2,X0,X1] :
( ~ subset(X1,X2)
| ~ subset(X0,X1)
| subset(X0,X2) ),
inference(cnf_transformation,[],[f48]) ).
fof(f89,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f63]) ).
fof(f90,plain,
~ subset(set_intersection2(sK0,sK2),set_intersection2(sK1,sK2)),
inference(cnf_transformation,[],[f63]) ).
fof(f126,plain,
! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f3]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] : subset(set_intersection2(X0,X1),X0),
inference(cnf_transformation,[],[f86]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(X0,set_intersection2(X1,X2))
| ~ subset(X0,X2)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f87]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(X0,X2)
| ~ subset(X1,X2)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f88]) ).
tcf(c_53,negated_conjecture,
~ subset(set_intersection2(sK0,sK2),set_intersection2(sK1,sK2)),
inference(cnf_transformation,[],[f90]) ).
tcf(c_54,negated_conjecture,
subset(sK0,sK1),
inference(cnf_transformation,[],[f89]) ).
tcf(c_90,plain,
! [X0: $i,X1: $i] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
inference(cnf_transformation,[],[f126]) ).
tcf(c_529,plain,
~ subset(set_intersection2(sK0,sK2),set_intersection2(sK2,sK1)),
inference(demodulation,[status(thm)],[c_53,c_90]) ).
tcf(c_2126,plain,
! [X0: $i,X1: $i] : subset(set_intersection2(X0,X1),X1),
inference(superposition,[status(thm)],[c_90,c_50]) ).
tcf(c_2561,plain,
! [X0: $i,X1: $i,X2: $i] :
( subset(set_intersection2(X0,X2),X1)
| ~ subset(X0,X1) ),
inference(superposition,[status(thm)],[c_50,c_52]) ).
tcf(c_2946,plain,
( ~ subset(set_intersection2(sK0,sK2),sK1)
| ~ subset(set_intersection2(sK0,sK2),sK2) ),
inference(superposition,[status(thm)],[c_51,c_529]) ).
tcf(c_2950,plain,
~ subset(set_intersection2(sK0,sK2),sK1),
inference(forward_subsumption_resolution,[status(thm)],[c_2946,c_2126]) ).
tcf(c_3049,plain,
~ subset(sK0,sK1),
inference(superposition,[status(thm)],[c_2561,c_2950]) ).
tcf(c_3050,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3049,c_54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU129+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/10.59 % Computer : n013.cluster.edu
% 0.09/10.59 % Model : x86_64 x86_64
% 0.09/10.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.59 % Memory : 8046.5625MB
% 0.09/10.59 % OS : Linux 6.8.0-71-generic
% 0.09/10.60 % CPULimit : 300
% 0.09/10.60 % WCLimit : 300
% 0.09/10.60 % DateTime : Thu Sep 24 12:51:28 UTC 2026
% 0.14/10.60 % CPUTime :
% 0.14/10.60 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/10.64 Running first-order theorem proving
% 0.14/10.64 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/10.65
% 0.14/10.65 % ======== iProver multi-core TPTP/SMT =========
% 0.14/10.65
% 0.14/10.65 % Detected problem language: tptp
% 0.14/10.66 % Proving...
% 3.60/11.50 % SZS status Started for theBenchmark.p
% 3.60/11.50 % SZS status Theorem for theBenchmark.p
% 3.60/11.50
% 3.60/11.50 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.60/11.50
% 3.60/11.50 % ------ iProver source info
% 3.60/11.50
% 3.60/11.50 % git: date: 2026-07-19 20:42:38 +0200
% 3.60/11.50 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.60/11.50 % git: non_committed_changes: false
% 3.60/11.50
% 3.60/11.50 % ------ Parsing...
% 3.60/11.50 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.60/11.50
% 3.60/11.50 % ------ Preprocessing... sup_sim: 1 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.60/11.50
% 3.60/11.50 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.60/11.50
% 3.60/11.50 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.60/11.50 % ------ Proving...
% 3.60/11.50 % ------ Problem Properties
% 3.60/11.50
% 3.60/11.50 %
% 3.60/11.50 % clauses 52
% 3.60/11.50 % conjectures 1
% 3.60/11.50 % EPR 17
% 3.60/11.50 % Horn 43
% 3.60/11.50 % unary 16
% 3.60/11.50 % binary 21
% 3.60/11.50 % lits 105
% 3.60/11.50 % lits eq 20
% 3.60/11.50 % fd_pure 0
% 3.60/11.50 % fd_pseudo 0
% 3.60/11.50 % fd_cond 3
% 3.60/11.50 % fd_pseudo_cond 8
% 3.60/11.50 % AC symbols 0
% 3.60/11.50
% 3.60/11.50 % ------ Schedule dynamic 5 is on
% 3.60/11.50
% 3.60/11.50 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.60/11.50
% 3.60/11.50
% 3.60/11.50 % ------
% 3.60/11.50 % Current options:
% 3.60/11.50 % ------
% 3.60/11.50
% 3.60/11.50
% 3.60/11.50 %
% 3.60/11.50
% 3.60/11.50 % ------ Proving...
% 3.60/11.50 %
% 3.60/11.50
% 3.60/11.50 % SZS status Theorem for theBenchmark.p
% 3.60/11.50
% 3.60/11.50 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.60/11.51
% 3.60/11.51
%------------------------------------------------------------------------------