%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC095+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n015.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:07:52 PM UTC 2026
% Result : Theorem 4.44s 1.51s
% Output : CNFRefutation 4.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 22 ( 13 unt; 0 def)
% Number of atoms : 99 ( 37 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 122 ( 45 ~; 37 |; 30 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 3 ( 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 : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn 29 !; 13 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( app(X7,X9) != X3
| app(app(X7,X8),X9) != X2
| ~ ssList(X9) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X1
& app(app(X4,X5),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( app(X7,X9) != X3
| app(app(X7,X8),X9) != X2
| ~ ssList(X9) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X1
& app(app(X4,X5),X6) = X0
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( app(X7,X9) = X3
& app(app(X7,X8),X9) = X2
& ssList(X9) ) ) )
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != X1
| app(app(X4,X5),X6) != X0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f117,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ssList(sK4)
& ssList(sK5)
& sK3 = app(sK4,sK6)
& sK2 = app(app(sK4,sK5),sK6)
& ssList(sK6)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK1
| app(app(X4,X5),X6) != sK0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X7,sK4),skolemize(X8,sK5),skolemize(X9,sK6)],[f98]) ).
fof(f125,plain,
ssList(sK4),
inference(cnf_transformation,[],[f117]) ).
fof(f126,plain,
ssList(sK5),
inference(cnf_transformation,[],[f117]) ).
fof(f127,plain,
sK3 = app(sK4,sK6),
inference(cnf_transformation,[],[f117]) ).
fof(f128,plain,
sK2 = app(app(sK4,sK5),sK6),
inference(cnf_transformation,[],[f117]) ).
fof(f129,plain,
ssList(sK6),
inference(cnf_transformation,[],[f117]) ).
fof(f130,plain,
! [X6,X4,X5] :
( app(X4,X6) != sK1
| app(app(X4,X5),X6) != sK0
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f117]) ).
fof(f131,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f117]) ).
fof(f132,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f117]) ).
fof(f157,plain,
! [X6,X4,X5] :
( app(X4,X6) != sK3
| app(app(X4,X5),X6) != sK2
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f130,f131,f132]) ).
tcf(c_50,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(X0,X2) != sK3 )
| ( app(app(X0,X1),X2) != sK2 ) ),
inference(cnf_transformation,[],[f157]) ).
tcf(c_51,negated_conjecture,
ssList(sK6),
inference(cnf_transformation,[],[f129]) ).
tcf(c_52,negated_conjecture,
app(app(sK4,sK5),sK6) = sK2,
inference(cnf_transformation,[],[f128]) ).
tcf(c_53,negated_conjecture,
app(sK4,sK6) = sK3,
inference(cnf_transformation,[],[f127]) ).
tcf(c_54,negated_conjecture,
ssList(sK5),
inference(cnf_transformation,[],[f126]) ).
tcf(c_55,negated_conjecture,
ssList(sK4),
inference(cnf_transformation,[],[f125]) ).
tcf(c_1138,plain,
( ~ ssList(sK5)
| ~ ssList(sK4)
| ~ ssList(sK6)
| ( app(sK4,sK6) != sK3 ) ),
inference(superposition,[status(thm)],[c_52,c_50]) ).
tcf(c_1141,plain,
( ~ ssList(sK5)
| ~ ssList(sK4)
| ~ ssList(sK6) ),
inference(ground_joinability,[status(thm)],[c_1138,c_53]) ).
tcf(c_1142,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1141,c_54,c_55,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC095+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.18/0.43 % Computer : n015.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Thu Sep 24 16:24:56 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.18/0.48 Running first-order theorem proving
% 0.18/0.48 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.18/0.50
% 0.18/0.50 % ======== iProver multi-core TPTP/SMT =========
% 0.18/0.50
% 0.18/0.50 % Detected problem language: tptp
% 0.24/0.52 % Proving...
% 4.44/1.51 % SZS status Started for theBenchmark.p
% 4.44/1.51 % SZS status Theorem for theBenchmark.p
% 4.44/1.51
% 4.44/1.51 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.44/1.51
% 4.44/1.51 % ------ iProver source info
% 4.44/1.51
% 4.44/1.51 % git: date: 2026-07-19 20:42:38 +0200
% 4.44/1.51 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.44/1.51 % git: non_committed_changes: false
% 4.44/1.51
% 4.44/1.51 % ------ Parsing...
% 4.44/1.51 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.44/1.51
% 4.44/1.51 % ------ Preprocessing... sup_sim: 0 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 %
% 4.44/1.51
% 4.44/1.51 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.44/1.51
% 4.44/1.51 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.44/1.51 % ------ Proving...
% 4.44/1.51 % ------ Problem Properties
% 4.44/1.51
% 4.44/1.51 %
% 4.44/1.51 % clauses 31
% 4.44/1.51 % conjectures 8
% 4.44/1.51 % EPR 9
% 4.44/1.51 % Horn 28
% 4.44/1.51 % unary 12
% 4.44/1.51 % binary 2
% 4.44/1.51 % lits 83
% 4.44/1.51 % lits eq 29
% 4.44/1.51 % fd_pure 0
% 4.44/1.51 % fd_pseudo 0
% 4.44/1.51 % fd_cond 4
% 4.44/1.51 % fd_pseudo_cond 4
% 4.44/1.51 % AC symbols 0
% 4.44/1.51
% 4.44/1.51 % ------ Schedule dynamic 5 is on
% 4.44/1.51
% 4.44/1.51 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.44/1.51
% 4.44/1.51
% 4.44/1.51 % ------
% 4.44/1.51 % Current options:
% 4.44/1.51 % ------
% 4.44/1.51
% 4.44/1.51
% 4.44/1.51 %
% 4.44/1.51
% 4.44/1.51 % ------ Proving...
% 4.44/1.51 %
% 4.44/1.51
% 4.44/1.51 % SZS status Theorem for theBenchmark.p
% 4.44/1.51
% 4.44/1.51 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.44/1.51
% 4.44/1.51
%------------------------------------------------------------------------------