%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWV366+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n001.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.50s 1.43s
% Output : CNFRefutation 3.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 23 unt; 6 def)
% Number of atoms : 55 ( 32 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 13 ( 8 ~; 0 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 6 usr; 7 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 79 ( 0 sgn 65 !; 14 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
fof(f55,axiom,
! [X0,X1,X2,X3,X4] : i(triple(X0,insert_slb(X1,pair(X3,X4)),X2)) = insert_pq(i(triple(X0,X1,X2)),X3),
file('/export/starexec/sandbox/benchmark/Axioms/SWV007+4.ax',ax55) ).
fof(f63,conjecture,
! [X0] :
( ! [X1,X2,X3,X4] : i(triple(X1,X0,X3)) = i(triple(X2,X0,X4))
=> ! [X5,X6,X7,X8,X9,X10] : i(triple(X5,insert_slb(X0,pair(X9,X10)),X7)) = i(triple(X6,insert_slb(X0,pair(X9,X10)),X8)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_co) ).
fof(f64,negated_conjecture,
~ ! [X0] :
( ! [X1,X2,X3,X4] : i(triple(X1,X0,X3)) = i(triple(X2,X0,X4))
=> ! [X5,X6,X7,X8,X9,X10] : i(triple(X5,insert_slb(X0,pair(X9,X10)),X7)) = i(triple(X6,insert_slb(X0,pair(X9,X10)),X8)) ),
inference(negated_conjecture,[status(cth)],[f63]) ).
fof(f115,plain,
? [X0] :
( ! [X1,X2,X3,X4] : i(triple(X1,X0,X3)) = i(triple(X2,X0,X4))
& ? [X5,X6,X7,X8,X9,X10] : i(triple(X5,insert_slb(X0,pair(X9,X10)),X7)) != i(triple(X6,insert_slb(X0,pair(X9,X10)),X8)) ),
inference(ennf_transformation,[],[f64]) ).
fof(f125,plain,
? [X0] :
( ! [X7,X8,X9,X10] : i(triple(X7,X0,X9)) = i(triple(X8,X0,X10))
& ? [X1,X2,X3,X4,X5,X6] : i(triple(X1,insert_slb(X0,pair(X5,X6)),X3)) != i(triple(X2,insert_slb(X0,pair(X5,X6)),X4)) ),
inference(rectify,[],[f115]) ).
fof(f126,plain,
( ! [X7,X8,X9,X10] : i(triple(X7,sK1,X9)) = i(triple(X8,sK1,X10))
& i(triple(sK2,insert_slb(sK1,pair(sK6,sK7)),sK4)) != i(triple(sK3,insert_slb(sK1,pair(sK6,sK7)),sK5)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5,sK6,sK7]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3),skolemize(X3,sK4),skolemize(X4,sK5),skolemize(X5,sK6),skolemize(X6,sK7)],[f125]) ).
fof(f191,plain,
! [X2,X3,X0,X1,X4] : i(triple(X0,insert_slb(X1,pair(X3,X4)),X2)) = insert_pq(i(triple(X0,X1,X2)),X3),
inference(cnf_transformation,[],[f55]) ).
fof(f192,plain,
! [X10,X8,X9,X7] : i(triple(X7,sK1,X9)) = i(triple(X8,sK1,X10)),
inference(cnf_transformation,[],[f126]) ).
fof(f193,plain,
i(triple(sK2,insert_slb(sK1,pair(sK6,sK7)),sK4)) != i(triple(sK3,insert_slb(sK1,pair(sK6,sK7)),sK5)),
inference(cnf_transformation,[],[f126]) ).
tcf(c_111,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] : i(triple(X0,insert_slb(X1,pair(X2,X3)),X4)) = insert_pq(i(triple(X0,X1,X4)),X2),
inference(cnf_transformation,[],[f191]) ).
tcf(c_112,negated_conjecture,
i(triple(sK2,insert_slb(sK1,pair(sK6,sK7)),sK4)) != i(triple(sK3,insert_slb(sK1,pair(sK6,sK7)),sK5)),
inference(cnf_transformation,[],[f193]) ).
tcf(c_113,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i] : i(triple(X0,sK1,X1)) = i(triple(X2,sK1,X3)),
inference(cnf_transformation,[],[f192]) ).
tcf(c_566,plain,
insert_pq(i(triple(sK2,sK1,sK4)),sK6) != insert_pq(i(triple(sK3,sK1,sK5)),sK6),
inference(demodulation,[status(thm)],[c_112,c_111]) ).
tcf(c_1382,definition,
iPr_def_10 = triple(sK2,sK1,sK4),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_1383,definition,
iPr_def_11 = i(iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_1384,definition,
iPr_def_12 = insert_pq(iPr_def_11,sK6),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_1385,definition,
iPr_def_13 = triple(sK3,sK1,sK5),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_1386,definition,
iPr_def_14 = i(iPr_def_13),
introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).
tcf(c_1387,definition,
iPr_def_15 = insert_pq(iPr_def_14,sK6),
introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).
tcf(c_1388,plain,
iPr_def_12 != iPr_def_15,
inference(demodulation,[status(thm)],[c_566,c_1385,c_1386,c_1387,c_1382,c_1383,c_1384]) ).
tcf(c_1389,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i] : i(triple(X0,sK1,X1)) = i(triple(X2,sK1,X3)),
inference(demodulation,[status(thm)],[c_113]) ).
tcf(c_2146,plain,
! [X0: $i,X1: $i] : i(triple(X0,sK1,X1)) = i(iPr_def_10),
inference(superposition,[status(thm)],[c_1382,c_1389]) ).
tcf(c_2148,plain,
! [X0: $i,X1: $i] : i(triple(X0,sK1,X1)) = iPr_def_11,
inference(light_normalisation,[status(thm)],[c_2146,c_1383]) ).
tcf(c_2152,plain,
i(iPr_def_13) = iPr_def_11,
inference(superposition,[status(thm)],[c_1385,c_2148]) ).
tcf(c_2153,plain,
iPr_def_11 = iPr_def_14,
inference(demodulation,[status(thm)],[c_1386,c_2152]) ).
tcf(c_2154,plain,
insert_pq(iPr_def_11,sK6) = iPr_def_15,
inference(demodulation,[status(thm)],[c_1387,c_2153]) ).
tcf(c_2155,plain,
iPr_def_12 = iPr_def_15,
inference(light_normalisation,[status(thm)],[c_2154,c_1384]) ).
tcf(c_2156,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2155,c_1388]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV366+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.52 % Computer : n001.cluster.edu
% 0.10/0.52 % Model : x86_64 x86_64
% 0.10/0.52 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.52 % Memory : 8046.5625MB
% 0.10/0.52 % OS : Linux 6.8.0-71-generic
% 0.10/0.52 % CPULimit : 300
% 0.10/0.52 % WCLimit : 300
% 0.10/0.52 % DateTime : Thu Sep 24 19:28:40 UTC 2026
% 0.10/0.52 % CPUTime :
% 0.10/0.52 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.55 Running first-order theorem proving
% 0.10/0.55 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.56
% 0.15/0.56 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.56
% 0.15/0.56 % Detected problem language: tptp
% 0.15/0.58 % Proving...
% 3.50/1.43 % SZS status Started for theBenchmark.p
% 3.50/1.43 % SZS status Theorem for theBenchmark.p
% 3.50/1.43
% 3.50/1.43 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.50/1.43
% 3.50/1.43 % ------ iProver source info
% 3.50/1.43
% 3.50/1.43 % git: date: 2026-07-19 20:42:38 +0200
% 3.50/1.43 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.50/1.43 % git: non_committed_changes: false
% 3.50/1.43
% 3.50/1.43 % ------ Parsing...
% 3.50/1.43 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.50/1.43
% 3.50/1.43 % ------ Preprocessing... sup_sim: 1 sf_s rm: 7 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e %
% 3.50/1.43
% 3.50/1.43 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.50/1.43
% 3.50/1.43 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.50/1.43 % ------ Proving...
% 3.50/1.43 % ------ Problem Properties
% 3.50/1.43
% 3.50/1.43 %
% 3.50/1.43 % clauses 63
% 3.50/1.43 % conjectures 1
% 3.50/1.43 % EPR 8
% 3.50/1.43 % Horn 46
% 3.50/1.43 % unary 30
% 3.50/1.43 % binary 15
% 3.50/1.43 % lits 115
% 3.50/1.43 % lits eq 48
% 3.50/1.43 % fd_pure 0
% 3.50/1.43 % fd_pseudo 0
% 3.50/1.43 % fd_cond 5
% 3.50/1.43 % fd_pseudo_cond 7
% 3.50/1.43 % AC symbols 0
% 3.50/1.43
% 3.50/1.43 % ------ Schedule dynamic 5 is on
% 3.50/1.43
% 3.50/1.43 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.50/1.43
% 3.50/1.43
% 3.50/1.43 % ------
% 3.50/1.43 % Current options:
% 3.50/1.43 % ------
% 3.50/1.43
% 3.50/1.43
% 3.50/1.43 %
% 3.50/1.43
% 3.50/1.43 % ------ Proving...
% 3.50/1.43 %
% 3.50/1.43
% 3.50/1.43 % SZS status Theorem for theBenchmark.p
% 3.50/1.43
% 3.50/1.43 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.50/1.43
% 3.50/1.43
%------------------------------------------------------------------------------