TSTP Solution File: LAT028-1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : LAT028-1 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 3 02:34:35 EDT 2024
% Result : Unsatisfiable 3.82s 1.13s
% Output : CNFRefutation 3.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 29 ( 29 unt; 0 nHn; 3 RR)
% Number of literals : 29 ( 28 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% 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 : 60 ( 23 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_50,plain,
meet2(X0,X1) = meet2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_meet2) ).
cnf(c_51,plain,
meet2(meet2(join(X0,X1),join(X2,X1)),X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wal_1_2) ).
cnf(c_52,plain,
join(join(meet2(X0,X1),meet2(X2,X1)),X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wal_2_2) ).
cnf(c_53,negated_conjecture,
meet2(a,b) != meet(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',name) ).
cnf(c_54,plain,
meet(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT005-0.ax',idempotence_of_meet) ).
cnf(c_55,plain,
join(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT005-0.ax',idempotence_of_join) ).
cnf(c_56,plain,
meet(X0,X1) = meet(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT005-0.ax',commutativity_of_meet) ).
cnf(c_57,plain,
join(X0,X1) = join(X1,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT005-0.ax',commutativity_of_join) ).
cnf(c_58,plain,
meet(meet(join(X0,X1),join(X2,X1)),X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT005-0.ax',wal_1) ).
cnf(c_59,plain,
join(join(meet(X0,X1),meet(X2,X1)),X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT005-0.ax',wal_2) ).
cnf(c_92,plain,
join(X0,join(meet(X1,X0),meet(X2,X0))) = X0,
inference(demodulation,[status(thm)],[c_59,c_57]) ).
cnf(c_93,plain,
meet(X0,meet(join(X1,X0),join(X2,X0))) = X0,
inference(demodulation,[status(thm)],[c_58,c_56]) ).
cnf(c_94,plain,
join(X0,join(meet2(X1,X0),meet2(X2,X0))) = X0,
inference(demodulation,[status(thm)],[c_52,c_57]) ).
cnf(c_95,plain,
meet2(X0,meet2(join(X1,X0),join(X2,X0))) = X0,
inference(demodulation,[status(thm)],[c_51,c_50]) ).
cnf(c_160,plain,
join(X0,meet(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_55,c_92]) ).
cnf(c_172,plain,
join(X0,meet(X0,X1)) = X0,
inference(superposition,[status(thm)],[c_56,c_160]) ).
cnf(c_178,plain,
meet(X0,join(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_54,c_93]) ).
cnf(c_208,plain,
join(X0,meet2(X1,X0)) = X0,
inference(superposition,[status(thm)],[c_55,c_94]) ).
cnf(c_231,plain,
meet2(meet(X0,X1),meet2(X1,join(X2,meet(X0,X1)))) = meet(X0,X1),
inference(superposition,[status(thm)],[c_160,c_95]) ).
cnf(c_271,plain,
join(X0,meet2(X0,X1)) = X0,
inference(superposition,[status(thm)],[c_50,c_208]) ).
cnf(c_274,plain,
meet(meet2(X0,X1),X1) = meet2(X0,X1),
inference(superposition,[status(thm)],[c_208,c_178]) ).
cnf(c_276,plain,
meet(meet2(X0,X1),meet(X1,join(X2,meet2(X0,X1)))) = meet2(X0,X1),
inference(superposition,[status(thm)],[c_208,c_93]) ).
cnf(c_447,plain,
meet(X0,meet2(X1,X0)) = meet2(X1,X0),
inference(superposition,[status(thm)],[c_274,c_56]) ).
cnf(c_1956,plain,
meet2(meet(X0,X1),meet2(X1,X0)) = meet(X0,X1),
inference(superposition,[status(thm)],[c_172,c_231]) ).
cnf(c_2575,plain,
meet(meet2(X0,X1),meet(X1,X0)) = meet2(X0,X1),
inference(superposition,[status(thm)],[c_271,c_276]) ).
cnf(c_3191,plain,
meet(meet2(X0,X1),meet(X1,X0)) = meet(X1,X0),
inference(superposition,[status(thm)],[c_1956,c_447]) ).
cnf(c_3204,plain,
meet2(X0,X1) = meet(X1,X0),
inference(light_normalisation,[status(thm)],[c_3191,c_2575]) ).
cnf(c_3258,plain,
meet2(a,b) != meet2(b,a),
inference(demodulation,[status(thm)],[c_53,c_3204]) ).
cnf(c_3261,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_3258,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT028-1 : TPTP v8.1.2. Released v2.2.0.
% 0.11/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n032.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu May 2 18:19:08 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.45 Running UEQ theorem proving
% 0.19/0.45 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule casc_24_ueq --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.82/1.13 % SZS status Started for theBenchmark.p
% 3.82/1.13 % SZS status Unsatisfiable for theBenchmark.p
% 3.82/1.13
% 3.82/1.13 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.82/1.13
% 3.82/1.13 ------ iProver source info
% 3.82/1.13
% 3.82/1.13 git: date: 2024-05-02 19:28:25 +0000
% 3.82/1.13 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.82/1.13 git: non_committed_changes: false
% 3.82/1.13
% 3.82/1.13 ------ Parsing...successful
% 3.82/1.13
% 3.82/1.13
% 3.82/1.13
% 3.82/1.13 ------ Preprocessing... sup_sim: 4 sf_s rm: 0 0s sf_e pe_s pe_e
% 3.82/1.13
% 3.82/1.13 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.82/1.13
% 3.82/1.13 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.82/1.13 ------ Proving...
% 3.82/1.13 ------ Problem Properties
% 3.82/1.13
% 3.82/1.13
% 3.82/1.13 clauses 11
% 3.82/1.13 conjectures 1
% 3.82/1.13 EPR 0
% 3.82/1.13 Horn 11
% 3.82/1.13 unary 11
% 3.82/1.13 binary 0
% 3.82/1.13 lits 11
% 3.82/1.13 lits eq 11
% 3.82/1.13 fd_pure 0
% 3.82/1.13 fd_pseudo 0
% 3.82/1.13 fd_cond 0
% 3.82/1.13 fd_pseudo_cond 0
% 3.82/1.13 AC symbols 0
% 3.82/1.13
% 3.82/1.13 ------ Input Options Time Limit: Unbounded
% 3.82/1.13
% 3.82/1.13
% 3.82/1.13 ------
% 3.82/1.13 Current options:
% 3.82/1.13 ------
% 3.82/1.13
% 3.82/1.13
% 3.82/1.13
% 3.82/1.13
% 3.82/1.13 ------ Proving...
% 3.82/1.13
% 3.82/1.13
% 3.82/1.13 % SZS status Unsatisfiable for theBenchmark.p
% 3.82/1.13
% 3.82/1.13 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.82/1.13
% 3.82/1.13
%------------------------------------------------------------------------------