%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LAT028-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 : 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 01:58:08 PM UTC 2026
% Result : Unsatisfiable 2.53s 1.28s
% Output : CNFRefutation 2.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 44 ( 44 unt; 0 def)
% Number of atoms : 44 ( 43 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 90 ( 0 sgn 90 !; 0 ?; 70 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : meet(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/LAT005-0.ax',idempotence_of_meet) ).
fof(f2,axiom,
! [X0] : join(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/LAT005-0.ax',idempotence_of_join) ).
fof(f3,axiom,
! [X0,X1] : meet(X0,X1) = meet(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/LAT005-0.ax',commutativity_of_meet) ).
fof(f4,axiom,
! [X0,X1] : join(X0,X1) = join(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/LAT005-0.ax',commutativity_of_join) ).
fof(f5,axiom,
! [X2,X0,X1] : meet(meet(join(X0,X1),join(X2,X1)),X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT005-0.ax',wal_1) ).
fof(f6,axiom,
! [X2,X0,X1] : join(join(meet(X0,X1),meet(X2,X1)),X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT005-0.ax',wal_2) ).
fof(f8,axiom,
! [X0,X1] : meet2(X0,X1) = meet2(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_meet2) ).
fof(f9,axiom,
! [X2,X0,X1] : meet2(meet2(join(X0,X1),join(X2,X1)),X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wal_1_2) ).
fof(f10,axiom,
! [X2,X0,X1] : join(join(meet2(X0,X1),meet2(X2,X1)),X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wal_2_2) ).
fof(f11,negated_conjecture,
meet(a,b) != meet2(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',name) ).
tcf(c_60,plain,
! [X0: $i] : meet(X0,X0) = X0,
inference(cnf_transformation,[],[f1]) ).
tcf(c_61,plain,
! [X0: $i] : join(X0,X0) = X0,
inference(cnf_transformation,[],[f2]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] : meet(X0,X1) = meet(X1,X0),
inference(cnf_transformation,[],[f3]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i] : join(X0,X1) = join(X1,X0),
inference(cnf_transformation,[],[f4]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i,X2: $i] : meet(meet(join(X0,X1),join(X2,X1)),X1) = X1,
inference(cnf_transformation,[],[f5]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i,X2: $i] : join(join(meet(X0,X1),meet(X2,X1)),X1) = X1,
inference(cnf_transformation,[],[f6]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i] : meet2(X0,X1) = meet2(X1,X0),
inference(cnf_transformation,[],[f8]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i,X2: $i] : meet2(meet2(join(X0,X1),join(X2,X1)),X1) = X1,
inference(cnf_transformation,[],[f9]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i,X2: $i] : join(join(meet2(X0,X1),meet2(X2,X1)),X1) = X1,
inference(cnf_transformation,[],[f10]) ).
tcf(c_70,negated_conjecture,
meet2(a,b) != meet(a,b),
inference(cnf_transformation,[],[f11]) ).
tcf(c_88,plain,
! [X0: $i,X1: $i] : meet(join(X0,X1),X1) = X1,
inference(superposition,[status(thm)],[c_60,c_64]) ).
tcf(c_97,plain,
! [X0: $i,X1: $i,X2: $i] : meet(X0,meet(join(X1,X0),join(X2,X0))) = X0,
inference(superposition,[status(thm)],[c_64,c_62]) ).
tcf(c_102,plain,
! [X0: $i,X1: $i] : join(meet(X0,X1),X1) = X1,
inference(superposition,[status(thm)],[c_61,c_65]) ).
tcf(c_129,plain,
! [X0: $i,X1: $i,X2: $i] : meet2(X0,meet2(join(X1,X0),join(X2,X0))) = X0,
inference(superposition,[status(thm)],[c_68,c_67]) ).
tcf(c_134,plain,
! [X0: $i,X1: $i] : join(meet2(X0,X1),X1) = X1,
inference(superposition,[status(thm)],[c_61,c_69]) ).
tcf(c_150,plain,
! [X0: $i,X1: $i] : join(X0,meet2(X1,X0)) = X0,
inference(demodulation,[status(thm)],[c_134,c_63]) ).
tcf(c_152,plain,
! [X0: $i,X1: $i] : join(X0,meet(X1,X0)) = X0,
inference(demodulation,[status(thm)],[c_102,c_63]) ).
tcf(c_153,plain,
! [X0: $i,X1: $i] : meet(X0,join(X1,X0)) = X0,
inference(demodulation,[status(thm)],[c_88,c_62]) ).
tcf(c_189,plain,
! [X0: $i,X1: $i] : join(X0,meet2(X0,X1)) = X0,
inference(superposition,[status(thm)],[c_67,c_150]) ).
tcf(c_304,plain,
! [X0: $i,X1: $i] : join(X0,meet(X0,X1)) = X0,
inference(superposition,[status(thm)],[c_62,c_152]) ).
tcf(c_318,plain,
! [X0: $i,X1: $i] : meet(meet2(X0,X1),X1) = meet2(X0,X1),
inference(superposition,[status(thm)],[c_150,c_153]) ).
tcf(c_338,plain,
! [X0: $i,X1: $i,X2: $i] : meet(meet2(X0,X1),meet(join(X2,meet2(X0,X1)),X1)) = meet2(X0,X1),
inference(superposition,[status(thm)],[c_150,c_97]) ).
tcf(c_382,plain,
! [X0: $i,X1: $i,X2: $i] : meet2(meet(X0,X1),meet2(join(X2,meet(X0,X1)),X1)) = meet(X0,X1),
inference(superposition,[status(thm)],[c_152,c_129]) ).
tcf(c_595,plain,
! [X0: $i,X1: $i] : meet(X0,meet2(X1,X0)) = meet2(X1,X0),
inference(demodulation,[status(thm)],[c_318,c_62]) ).
tcf(c_605,plain,
! [X0: $i,X1: $i,X2: $i] : meet2(meet(X0,X1),meet2(X1,join(X2,meet(X0,X1)))) = meet(X0,X1),
inference(demodulation,[status(thm)],[c_382,c_67]) ).
tcf(c_607,plain,
! [X0: $i,X1: $i,X2: $i] : meet(meet2(X0,X1),meet(X1,join(X2,meet2(X0,X1)))) = meet2(X0,X1),
inference(demodulation,[status(thm)],[c_338,c_62]) ).
tcf(c_1263,plain,
! [X0: $i,X1: $i] : meet(X0,meet2(X0,X1)) = meet2(X0,X1),
inference(superposition,[status(thm)],[c_67,c_595]) ).
tcf(c_6424,plain,
! [X0: $i,X1: $i] : meet2(meet(X0,X1),meet2(X1,X0)) = meet(X0,X1),
inference(superposition,[status(thm)],[c_304,c_605]) ).
tcf(c_6582,plain,
! [X0: $i,X1: $i] : meet2(meet2(X0,X1),meet(X1,X0)) = meet(X1,X0),
inference(demodulation,[status(thm)],[c_6424,c_67]) ).
tcf(c_7051,plain,
! [X0: $i,X1: $i] : meet(meet2(X0,X1),meet(X1,X0)) = meet(X1,X0),
inference(superposition,[status(thm)],[c_6582,c_1263]) ).
tcf(c_7100,plain,
! [X0: $i,X1: $i] : meet(meet2(X0,X1),meet(X1,X0)) = meet2(X0,X1),
inference(superposition,[status(thm)],[c_189,c_607]) ).
tcf(c_7316,plain,
! [X0: $i,X1: $i] : meet2(X0,X1) = meet(X1,X0),
inference(demodulation,[status(thm)],[c_7051,c_7100]) ).
tcf(c_7575,plain,
meet2(a,b) != meet2(b,a),
inference(demodulation,[status(thm)],[c_70,c_7316]) ).
tcf(c_7578,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_7575,c_67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT028-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.11/0.37 % Computer : n001.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 : Wed Sep 23 20:08:50 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/0.41 Running UEQ theorem proving
% 0.11/0.41 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.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 2.53/1.28 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.53/1.28 % SZS status Started for theBenchmark.p
% 2.53/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 2.53/1.28
% 2.53/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.53/1.28
% 2.53/1.28 % ------ iProver source info
% 2.53/1.28
% 2.53/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 2.53/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.53/1.28 % git: non_committed_changes: false
% 2.53/1.28
% 2.53/1.28 % ------ Parsing...% successful
% 2.53/1.28
% 2.53/1.28
% 2.53/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...
% 2.53/1.28 % ------ Proving...
% 2.53/1.28 % ------ Problem Properties
% 2.53/1.28
% 2.53/1.28 %
% 2.53/1.28 % clauses 11
% 2.53/1.28 % conjectures 1
% 2.53/1.28 % EPR 0
% 2.53/1.28 % Horn 11
% 2.53/1.28 % unary 11
% 2.53/1.28 % binary 0
% 2.53/1.28 % lits 11
% 2.53/1.28 % lits eq 11
% 2.53/1.28 % fd_pure 0
% 2.53/1.28 % fd_pseudo 0
% 2.53/1.28 % fd_cond 0
% 2.53/1.28 % fd_pseudo_cond 0
% 2.53/1.28 % AC symbols 0
% 2.53/1.28
% 2.53/1.28 % ------ Input Options Time Limit: Unbounded
% 2.53/1.28
% 2.53/1.28
% 2.53/1.28 % ------
% 2.53/1.28 % Current options:
% 2.53/1.28 % ------
% 2.53/1.28
% 2.53/1.28
% 2.53/1.28 %
% 2.53/1.28
% 2.53/1.28 % ------ Proving...
% 2.53/1.28 %
% 2.53/1.28
% 2.53/1.28 % SZS status Unsatisfiable for theBenchmark.p
% 2.53/1.28
% 2.53/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.53/1.28
% 2.53/1.28
%------------------------------------------------------------------------------