%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LAT032-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 : n019.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 01:58:08 PM UTC 2026
% Result : Unsatisfiable 3.78s 1.25s
% Output : CNFRefutation 3.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 24 ( 24 unt; 0 def)
% Number of atoms : 24 ( 23 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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 : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 48 ( 0 sgn 48 !; 0 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0,X1] : meet(X0,join(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption1) ).
fof(f4,axiom,
! [X0,X1] : join(X0,meet(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption2) ).
fof(f5,axiom,
! [X0,X1] : meet(X0,X1) = meet(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).
fof(f6,axiom,
! [X0,X1] : join(X0,X1) = join(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).
fof(f7,axiom,
! [X2,X0,X1] : meet(meet(X0,X1),X2) = meet(X0,meet(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).
fof(f8,axiom,
! [X2,X0,X1] : join(join(X0,X1),X2) = join(X0,join(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',associativity_of_join) ).
fof(f9,axiom,
! [X2,X0,X1] : join(X0,meet(X1,X2)) = meet(join(X0,X1),join(X0,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dist_join) ).
fof(f10,negated_conjecture,
meet(xx,join(yy,zz)) != join(meet(xx,yy),meet(xx,zz)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dist_meet) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] : meet(X0,join(X0,X1)) = X0,
inference(cnf_transformation,[],[f3]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] : join(X0,meet(X0,X1)) = X0,
inference(cnf_transformation,[],[f4]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] : meet(X0,X1) = meet(X1,X0),
inference(cnf_transformation,[],[f5]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] : join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f6]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i,X2: $i] : meet(meet(X0,X1),X2) = meet(X0,meet(X1,X2)),
inference(cnf_transformation,[],[f7]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i,X2: $i] : join(join(X0,X1),X2) = join(X0,join(X1,X2)),
inference(cnf_transformation,[],[f8]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i,X2: $i] : meet(join(X0,X1),join(X0,X2)) = join(X0,meet(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
tcf(c_68,negated_conjecture,
join(meet(xx,yy),meet(xx,zz)) != meet(xx,join(yy,zz)),
inference(cnf_transformation,[],[f10]) ).
tcf(c_159,plain,
! [X0: $i,X1: $i] : meet(X0,join(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_64,c_61]) ).
tcf(c_230,plain,
! [X0: $i,X1: $i,X2: $i] : meet(join(X0,X1),join(X1,X2)) = join(X1,meet(X0,X2)),
inference(superposition,[status(thm)],[c_64,c_67]) ).
tcf(c_292,plain,
! [X0: $i,X1: $i,X2: $i] : meet(X0,meet(join(X1,X0),X2)) = meet(X0,X2),
inference(superposition,[status(thm)],[c_159,c_65]) ).
tcf(c_1018,plain,
! [X0: $i,X1: $i,X2: $i] : meet(X0,join(X1,meet(X0,X2))) = meet(X0,join(X1,X2)),
inference(superposition,[status(thm)],[c_67,c_292]) ).
tcf(c_3027,plain,
! [X0: $i,X1: $i,X2: $i] : meet(X0,join(meet(X0,X1),X2)) = join(meet(X0,X1),meet(X0,X2)),
inference(superposition,[status(thm)],[c_62,c_230]) ).
tcf(c_3159,plain,
meet(xx,join(meet(xx,yy),zz)) != meet(xx,join(yy,zz)),
inference(demodulation,[status(thm)],[c_68,c_3027]) ).
tcf(c_3160,plain,
meet(xx,join(zz,meet(xx,yy))) != meet(xx,join(yy,zz)),
inference(theory_normalisation,[status(thm)],[c_3159,c_65,c_63,c_66,c_64]) ).
tcf(c_3161,plain,
$false,
inference(ground_joinability,[status(thm)],[c_3160,c_64,c_1018]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LAT032-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.34 % Computer : n019.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Wed Sep 23 20:04:04 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.08/0.34 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.37 Running UEQ theorem proving
% 0.12/0.37 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.12/0.38
% 0.12/0.38 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.38
% 0.12/0.38 % Detected problem language: tptp
% 0.12/0.39 % Proving...
% 3.78/1.25 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 3.78/1.25 % SZS status Started for theBenchmark.p
% 3.78/1.25 % SZS status Unsatisfiable for theBenchmark.p
% 3.78/1.25
% 3.78/1.25 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.78/1.25
% 3.78/1.25 % ------ iProver source info
% 3.78/1.25
% 3.78/1.25 % git: date: 2026-07-19 20:42:38 +0200
% 3.78/1.25 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.78/1.25 % git: non_committed_changes: false
% 3.78/1.25
% 3.78/1.25 % ------ Parsing...% successful
% 3.78/1.25
% 3.78/1.25
% 3.78/1.25 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.78/1.25
% 3.78/1.25 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.78/1.25
% 3.78/1.25 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.78/1.25
% 3.78/1.25 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.78/1.25 % ------ Proving...
% 3.78/1.25 % ------ Problem Properties
% 3.78/1.25
% 3.78/1.25 %
% 3.78/1.25 % clauses 10
% 3.78/1.25 % conjectures 1
% 3.78/1.25 % EPR 0
% 3.78/1.25 % Horn 10
% 3.78/1.25 % unary 10
% 3.78/1.25 % binary 0
% 3.78/1.25 % lits 10
% 3.78/1.25 % lits eq 10
% 3.78/1.25 % fd_pure 0
% 3.78/1.25 % fd_pseudo 0
% 3.78/1.25 % fd_cond 0
% 3.78/1.25 % fd_pseudo_cond 0
% 3.78/1.25 % AC symbols 2
% 3.78/1.25
% 3.78/1.25 % ------ Input Options Time Limit: Unbounded
% 3.78/1.25
% 3.78/1.25
% 3.78/1.25 % ------
% 3.78/1.25 % Current options:
% 3.78/1.25 % ------
% 3.78/1.25
% 3.78/1.25
% 3.78/1.25 %
% 3.78/1.25
% 3.78/1.25 % ------ Proving...
% 3.78/1.25 %
% 3.78/1.25
% 3.78/1.25 % SZS status Unsatisfiable for theBenchmark.p
% 3.78/1.25
% 3.78/1.25 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.78/1.25
% 3.78/1.25
%------------------------------------------------------------------------------