%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LAT011-1 : TPTP v9.3.1. Released v2.2.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 01:58:06 PM UTC 2026
% Result : Unsatisfiable 0.82s 1.21s
% Output : CNFRefutation 0.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 59 ( 59 unt; 2 def)
% Number of atoms : 101 ( 58 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 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 : 4 ( 2 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 74 ( 0 sgn 74 !; 0 ?; 54 :)
% 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(f10,axiom,
! [X0,X1] : meet2(X0,X1) = meet2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_meet2) ).
fof(f11,axiom,
! [X0,X1] : meet2(X0,join(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',absorption1_2) ).
fof(f12,axiom,
! [X0,X1] : join(X0,meet2(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',absorption2_2) ).
fof(f13,axiom,
! [X2,X0,X1] : meet2(meet2(X0,X1),X2) = meet2(X0,meet2(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_meet2) ).
fof(f14,negated_conjecture,
meet(a,b) != meet2(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_meets_are_same) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] : meet(X0,join(X0,X1)) = X0,
inference(cnf_transformation,[],[f3]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i] : join(X0,meet(X0,X1)) = X0,
inference(cnf_transformation,[],[f4]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i] : meet(X0,X1) = meet(X1,X0),
inference(cnf_transformation,[],[f5]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] : join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f6]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i,X2: $i] : meet(meet(X0,X1),X2) = meet(X0,meet(X1,X2)),
inference(cnf_transformation,[],[f7]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i] : meet2(X0,X1) = meet2(X1,X0),
inference(cnf_transformation,[],[f10]) ).
tcf(c_73,plain,
! [X0: $i,X1: $i] : meet2(X0,join(X0,X1)) = X0,
inference(cnf_transformation,[],[f11]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] : join(X0,meet2(X0,X1)) = X0,
inference(cnf_transformation,[],[f12]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i,X2: $i] : meet2(meet2(X0,X1),X2) = meet2(X0,meet2(X1,X2)),
inference(cnf_transformation,[],[f13]) ).
tcf(c_76,negated_conjecture,
meet2(a,b) != meet(a,b),
inference(cnf_transformation,[],[f14]) ).
tcf(c_123,definition,
iPr_def_10 = meet2(a,b),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_124,definition,
iPr_def_11 = meet(a,b),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_125,negated_conjecture,
iPr_def_10 != iPr_def_11,
inference(demodulation,[status(thm)],[c_76,c_124,c_123]) ).
tcf(c_127,plain,
! [X0: $i,X1: $i,X2: $i] : meet(meet(X0,X1),X2) = meet(X0,meet(X1,X2)),
inference(demodulation,[status(thm)],[c_69]) ).
tcf(c_128,plain,
! [X0: $i,X1: $i] : join(X0,X1) = join(X1,X0),
inference(demodulation,[status(thm)],[c_68]) ).
tcf(c_129,plain,
! [X0: $i,X1: $i] : meet(X0,X1) = meet(X1,X0),
inference(demodulation,[status(thm)],[c_67]) ).
tcf(c_130,plain,
! [X0: $i,X1: $i] : join(X0,meet(X0,X1)) = X0,
inference(demodulation,[status(thm)],[c_66]) ).
tcf(c_131,plain,
! [X0: $i,X1: $i] : meet(X0,join(X0,X1)) = X0,
inference(demodulation,[status(thm)],[c_65]) ).
tcf(c_134,plain,
! [X0: $i,X1: $i,X2: $i] : meet2(meet2(X0,X1),X2) = meet2(X0,meet2(X1,X2)),
inference(demodulation,[status(thm)],[c_75]) ).
tcf(c_135,plain,
! [X0: $i,X1: $i] : join(X0,meet2(X0,X1)) = X0,
inference(demodulation,[status(thm)],[c_74]) ).
tcf(c_136,plain,
! [X0: $i,X1: $i] : meet2(X0,join(X0,X1)) = X0,
inference(demodulation,[status(thm)],[c_73]) ).
tcf(c_137,plain,
! [X0: $i,X1: $i] : meet2(X0,X1) = meet2(X1,X0),
inference(demodulation,[status(thm)],[c_72]) ).
tcf(c_203,plain,
! [X0: $i,X1: $i,X2: $i] : meet2(X0,meet2(X1,X2)) = meet2(X1,meet2(X0,X2)),
inference(superposition,[status(thm)],[c_134,c_137]) ).
tcf(c_205,plain,
! [X0: $i,X1: $i,X2: $i] : meet(X0,meet(X1,X2)) = meet(X1,meet(X0,X2)),
inference(superposition,[status(thm)],[c_127,c_129]) ).
tcf(c_225,plain,
join(a,iPr_def_11) = a,
inference(superposition,[status(thm)],[c_124,c_130]) ).
tcf(c_227,plain,
! [X0: $i,X1: $i] : join(X0,meet(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_129,c_130]) ).
tcf(c_232,plain,
join(iPr_def_11,a) = a,
inference(demodulation,[status(thm)],[c_225,c_128]) ).
tcf(c_242,plain,
! [X0: $i,X1: $i] : meet(X0,join(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_128,c_131]) ).
tcf(c_256,plain,
join(a,iPr_def_10) = a,
inference(superposition,[status(thm)],[c_123,c_135]) ).
tcf(c_260,plain,
join(iPr_def_10,a) = a,
inference(demodulation,[status(thm)],[c_256,c_128]) ).
tcf(c_269,plain,
meet2(iPr_def_11,a) = iPr_def_11,
inference(superposition,[status(thm)],[c_232,c_136]) ).
tcf(c_272,plain,
! [X0: $i,X1: $i] : join(X0,meet2(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_137,c_135]) ).
tcf(c_295,plain,
! [X0: $i] : meet2(a,meet2(X0,b)) = meet2(X0,iPr_def_10),
inference(superposition,[status(thm)],[c_123,c_203]) ).
tcf(c_332,plain,
! [X0: $i] : meet(a,meet(X0,b)) = meet(X0,iPr_def_11),
inference(superposition,[status(thm)],[c_124,c_205]) ).
tcf(c_367,plain,
meet(iPr_def_10,a) = iPr_def_10,
inference(superposition,[status(thm)],[c_260,c_131]) ).
tcf(c_400,plain,
join(b,iPr_def_11) = b,
inference(superposition,[status(thm)],[c_124,c_227]) ).
tcf(c_417,plain,
join(iPr_def_11,b) = b,
inference(demodulation,[status(thm)],[c_400,c_128]) ).
tcf(c_420,plain,
meet2(iPr_def_11,b) = iPr_def_11,
inference(superposition,[status(thm)],[c_417,c_136]) ).
tcf(c_637,plain,
join(b,iPr_def_10) = b,
inference(superposition,[status(thm)],[c_123,c_272]) ).
tcf(c_653,plain,
join(iPr_def_10,b) = b,
inference(demodulation,[status(thm)],[c_637,c_128]) ).
tcf(c_666,plain,
meet(iPr_def_10,b) = iPr_def_10,
inference(superposition,[status(thm)],[c_653,c_131]) ).
tcf(c_2056,plain,
meet2(a,iPr_def_11) = meet2(iPr_def_11,iPr_def_10),
inference(superposition,[status(thm)],[c_420,c_295]) ).
tcf(c_2071,plain,
meet2(iPr_def_10,iPr_def_11) = iPr_def_11,
inference(demodulation,[status(thm)],[c_2056,c_137,c_269]) ).
tcf(c_2085,plain,
join(iPr_def_10,iPr_def_11) = iPr_def_10,
inference(superposition,[status(thm)],[c_2071,c_135]) ).
tcf(c_2142,plain,
meet(iPr_def_11,iPr_def_10) = iPr_def_11,
inference(superposition,[status(thm)],[c_2085,c_242]) ).
tcf(c_2147,plain,
meet(iPr_def_10,iPr_def_11) = iPr_def_11,
inference(demodulation,[status(thm)],[c_2142,c_129]) ).
tcf(c_2953,plain,
meet(a,iPr_def_10) = meet(iPr_def_10,iPr_def_11),
inference(superposition,[status(thm)],[c_666,c_332]) ).
tcf(c_2972,plain,
iPr_def_10 = iPr_def_11,
inference(demodulation,[status(thm)],[c_2953,c_129,c_367,c_2147]) ).
tcf(c_2973,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2972,c_125]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT011-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.39 % Computer : n015.cluster.edu
% 0.10/0.39 % Model : x86_64 x86_64
% 0.10/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39 % Memory : 8046.5625MB
% 0.10/0.39 % OS : Linux 6.8.0-71-generic
% 0.10/0.39 % CPULimit : 300
% 0.10/0.39 % WCLimit : 300
% 0.10/0.39 % DateTime : Wed Sep 23 20:03:55 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.43 Running UEQ theorem proving
% 0.10/0.43 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.10/0.44
% 0.10/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.44
% 0.10/0.44 % Detected problem language: tptp
% 0.10/0.45 % Proving...
% 0.82/1.21 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 0.82/1.21 % SZS status Started for theBenchmark.p
% 0.82/1.21 % SZS status Unsatisfiable for theBenchmark.p
% 0.82/1.21
% 0.82/1.21 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.82/1.21
% 0.82/1.21 % ------ iProver source info
% 0.82/1.21
% 0.82/1.21 % git: date: 2026-07-19 20:42:38 +0200
% 0.82/1.21 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.82/1.21 % git: non_committed_changes: false
% 0.82/1.21
% 0.82/1.21 % ------ Parsing...% successful
% 0.82/1.21
% 0.82/1.21
% 0.82/1.21 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.82/1.21
% 0.82/1.21 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 0.82/1.21
% 0.82/1.21 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.82/1.21
% 0.82/1.21 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.82/1.21 % ------ Proving...
% 0.82/1.21 % ------ Problem Properties
% 0.82/1.21
% 0.82/1.21 %
% 0.82/1.21 % clauses 16
% 0.82/1.21 % conjectures 1
% 0.82/1.21 % EPR 1
% 0.82/1.21 % Horn 16
% 0.82/1.21 % unary 16
% 0.82/1.21 % binary 0
% 0.82/1.21 % lits 16
% 0.82/1.21 % lits eq 16
% 0.82/1.21 % fd_pure 0
% 0.82/1.21 % fd_pseudo 0
% 0.82/1.21 % fd_cond 0
% 0.82/1.21 % fd_pseudo_cond 0
% 0.82/1.21 % AC symbols 3
% 0.82/1.21
% 0.82/1.21 % ------ Input Options Time Limit: Unbounded
% 0.82/1.21
% 0.82/1.21
% 0.82/1.21 % ------
% 0.82/1.21 % Current options:
% 0.82/1.21 % ------
% 0.82/1.21
% 0.82/1.21
% 0.82/1.21 %
% 0.82/1.21
% 0.82/1.21 % ------ Proving...
% 0.82/1.21 %
% 0.82/1.21
% 0.82/1.21 % SZS status Unsatisfiable for theBenchmark.p
% 0.82/1.21
% 0.82/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.82/1.21
% 0.82/1.21
%------------------------------------------------------------------------------