%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : REL008-1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n010.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:36:33 PM UTC 2026
% Result : Unsatisfiable 13.52s 2.80s
% Output : CNFRefutation 16.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 18 unt; 0 def)
% Number of atoms : 18 ( 17 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 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 : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn 35 !; 0 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X2,X0,X1] : composition(join(X0,X1),X2) = join(composition(X0,X2),composition(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',composition_distributivity_7) ).
fof(f10,axiom,
! [X0] : converse(converse(X0)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).
fof(f11,axiom,
! [X0,X1] : converse(join(X0,X1)) = join(converse(X0),converse(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_additivity_9) ).
fof(f12,axiom,
! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_multiplicativity_10) ).
fof(f17,negated_conjecture,
composition(sk1,join(sk2,sk3)) != join(composition(sk1,sk2),composition(sk1,sk3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_14) ).
tcf(c_68,plain,
! [X0: $i,X1: $i,X2: $i] : join(composition(X0,X1),composition(X2,X1)) = composition(join(X0,X2),X1),
inference(cnf_transformation,[],[f9]) ).
tcf(c_69,plain,
! [X0: $i] : converse(converse(X0)) = X0,
inference(cnf_transformation,[],[f10]) ).
tcf(c_70,plain,
! [X0: $i,X1: $i] : join(converse(X0),converse(X1)) = converse(join(X0,X1)),
inference(cnf_transformation,[],[f11]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i] : composition(converse(X0),converse(X1)) = converse(composition(X1,X0)),
inference(cnf_transformation,[],[f12]) ).
tcf(c_75,negated_conjecture,
join(composition(sk1,sk2),composition(sk1,sk3)) != composition(sk1,join(sk2,sk3)),
inference(cnf_transformation,[],[f17]) ).
tcf(c_1804,plain,
! [X0: $i,X1: $i] : converse(join(converse(X0),X1)) = join(X0,converse(X1)),
inference(superposition,[status(thm)],[c_69,c_70]) ).
tcf(c_1810,plain,
! [X0: $i,X1: $i] : converse(composition(converse(X0),X1)) = composition(converse(X1),X0),
inference(superposition,[status(thm)],[c_69,c_71]) ).
tcf(c_1816,plain,
! [X0: $i,X1: $i,X2: $i] : join(converse(composition(X0,X1)),composition(X2,converse(X0))) = composition(join(converse(X1),X2),converse(X0)),
inference(superposition,[status(thm)],[c_71,c_68]) ).
tcf(c_15270,plain,
! [X0: $i,X1: $i,X2: $i] : composition(converse(X0),join(X1,converse(X2))) = converse(composition(join(converse(X1),X2),X0)),
inference(superposition,[status(thm)],[c_1804,c_71]) ).
tcf(c_15403,plain,
! [X0: $i,X1: $i,X2: $i] : join(converse(X0),composition(converse(X1),X2)) = converse(join(X0,composition(converse(X2),X1))),
inference(superposition,[status(thm)],[c_1810,c_70]) ).
tcf(c_21588,plain,
! [X0: $i,X1: $i,X2: $i] : join(converse(converse(composition(X0,X1))),composition(converse(converse(X0)),X2)) = converse(composition(join(converse(X1),converse(X2)),converse(X0))),
inference(superposition,[status(thm)],[c_1816,c_15403]) ).
tcf(c_21805,plain,
! [X0: $i,X1: $i,X2: $i] : join(composition(X0,X1),composition(X0,X2)) = composition(X0,join(X1,X2)),
inference(demodulation,[status(thm)],[c_21588,c_69,c_15270]) ).
tcf(c_21898,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_75,c_21805]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : REL008-1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n010.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Thu Sep 24 07:09:58 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.16/0.40 Running UEQ theorem proving
% 0.16/0.40 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.41
% 0.16/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.16/0.41
% 0.16/0.42 % Detected problem language: tptp
% 0.16/0.43 % Proving...
% 13.52/2.80 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 13.52/2.80 % SZS status Started for theBenchmark.p
% 13.52/2.80 % SZS status Unsatisfiable for theBenchmark.p
% 13.52/2.80
% 13.52/2.80 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 13.52/2.80
% 13.52/2.80 % ------ iProver source info
% 13.52/2.80
% 13.52/2.80 % git: date: 2026-07-19 20:42:38 +0200
% 13.52/2.80 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 13.52/2.80 % git: non_committed_changes: false
% 13.52/2.80
% 13.52/2.80 % ------ Parsing...% successful
% 13.52/2.80
% 13.52/2.80
% 13.52/2.80 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 13.52/2.80 % ------ Proving...
% 13.52/2.80 % ------ Problem Properties
% 13.52/2.80
% 13.52/2.80 %
% 13.52/2.80 % clauses 13
% 13.52/2.80 % conjectures 1
% 13.52/2.80 % EPR 0
% 13.52/2.80 % Horn 13
% 13.52/2.80 % unary 13
% 13.52/2.80 % binary 0
% 13.52/2.80 % lits 13
% 13.52/2.80 % lits eq 13
% 13.52/2.80 % fd_pure 0
% 13.52/2.80 % fd_pseudo 0
% 13.52/2.80 % fd_cond 0
% 13.52/2.80 % fd_pseudo_cond 0
% 13.52/2.80 % AC symbols 1
% 13.52/2.80
% 13.52/2.80 % ------ Input Options Time Limit: Unbounded
% 13.52/2.80
% 13.52/2.80
% 13.52/2.80 % ------
% 13.52/2.80 % Current options:
% 13.52/2.80 % ------
% 13.52/2.80
% 13.52/2.80
% 13.52/2.80 %
% 13.52/2.80
% 13.52/2.80 % ------ Proving...
% 13.52/2.80 %
% 13.52/2.80
% 13.52/2.80 % SZS status Unsatisfiable for theBenchmark.p
% 13.52/2.80
% 13.52/2.80 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 16.16/2.80
% 16.16/2.80
%------------------------------------------------------------------------------