TSTP Solution File: LAT042-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : LAT042-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n012.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 : Thu Aug 31 06:16:33 EDT 2023
% Result : Unsatisfiable 0.48s 1.18s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 6 RR)
% Number of literals : 14 ( 13 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% 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 : 19 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c_49,plain,
join(meet(X0,X1),meet(X0,X2)) = meet(X0,join(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distributivity) ).
cnf(c_53,negated_conjecture,
join(a,meet(b,join(a,c))) != meet(join(a,b),join(a,c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_modular_law) ).
cnf(c_54,plain,
meet(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',idempotence_of_meet) ).
cnf(c_57,plain,
join(X0,meet(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption2) ).
cnf(c_58,plain,
meet(X0,X1) = meet(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).
cnf(c_59,plain,
join(X0,X1) = join(X1,X0),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).
cnf(c_60,plain,
meet(meet(X0,X1),X2) = meet(X0,meet(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).
cnf(c_61,plain,
join(join(X0,X1),X2) = join(X0,join(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',associativity_of_join) ).
cnf(c_170,plain,
join(meet(join(a,b),a),meet(join(a,b),c)) != join(a,meet(b,join(a,c))),
inference(superposition,[status(thm)],[c_49,c_53]) ).
cnf(c_186,plain,
join(meet(X0,X1),meet(X0,X2)) = meet(join(X1,X2),X0),
inference(superposition,[status(thm)],[c_58,c_49]) ).
cnf(c_302,plain,
join(join(meet(a,a),meet(a,b)),join(meet(c,a),meet(c,b))) != join(a,meet(b,join(a,c))),
inference(demodulation,[status(thm)],[c_170,c_186]) ).
cnf(c_303,plain,
join(a,join(meet(b,a),meet(b,c))) != join(a,join(meet(c,a),meet(c,b))),
inference(demodulation,[status(thm)],[c_302,c_49,c_54,c_57]) ).
cnf(c_304,plain,
join(a,join(meet(a,b),meet(b,c))) != join(a,join(meet(a,c),meet(b,c))),
inference(theory_normalisation,[status(thm)],[c_303,c_61,c_59,c_60,c_58]) ).
cnf(c_305,plain,
$false,
inference(ac_demodulation,[status(thm)],[c_304,c_57,c_57,c_61,c_59,c_60,c_58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LAT042-1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 24 04:16:12 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.48 Running UEQ theorem proving
% 0.22/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule casc_29_ueq --heuristic_context ueq --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.48/1.18 % SZS status Started for theBenchmark.p
% 0.48/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 0.48/1.18
% 0.48/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.48/1.18
% 0.48/1.18 ------ iProver source info
% 0.48/1.18
% 0.48/1.18 git: date: 2023-05-31 18:12:56 +0000
% 0.48/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.48/1.18 git: non_committed_changes: false
% 0.48/1.18 git: last_make_outside_of_git: false
% 0.48/1.18
% 0.48/1.18 ------ Parsing...successful
% 0.48/1.18
% 0.48/1.18
% 0.48/1.18
% 0.48/1.18 ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e
% 0.48/1.18
% 0.48/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.48/1.18
% 0.48/1.18 ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.48/1.18 ------ Proving...
% 0.48/1.18 ------ Problem Properties
% 0.48/1.18
% 0.48/1.18
% 0.48/1.18 clauses 13
% 0.48/1.18 conjectures 1
% 0.48/1.18 EPR 0
% 0.48/1.18 Horn 13
% 0.48/1.18 unary 13
% 0.48/1.18 binary 0
% 0.48/1.18 lits 13
% 0.48/1.18 lits eq 13
% 0.48/1.18 fd_pure 0
% 0.48/1.18 fd_pseudo 0
% 0.48/1.18 fd_cond 0
% 0.48/1.18 fd_pseudo_cond 0
% 0.48/1.18 AC symbols 2
% 0.48/1.18
% 0.48/1.18 ------ Input Options Time Limit: Unbounded
% 0.48/1.18
% 0.48/1.18
% 0.48/1.18 ------
% 0.48/1.18 Current options:
% 0.48/1.18 ------
% 0.48/1.18
% 0.48/1.18
% 0.48/1.18
% 0.48/1.18
% 0.48/1.18 ------ Proving...
% 0.48/1.18
% 0.48/1.18
% 0.48/1.18 % SZS status Unsatisfiable for theBenchmark.p
% 0.48/1.18
% 0.48/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.48/1.18
% 0.48/1.18
%------------------------------------------------------------------------------