TSTP Solution File: GRP163-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GRP163-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n011.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 : 600s
% DateTime : Sat Jul 16 11:45:59 EDT 2022
% Result : Unsatisfiable 0.20s 0.42s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 17 RR)
% Number of literals : 17 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(greatest_lower_bound(a,b),a),
file('GRP163-1.p',unknown),
[] ).
cnf(2,axiom,
equal(greatest_lower_bound(b,c),b),
file('GRP163-1.p',unknown),
[] ).
cnf(3,axiom,
~ equal(greatest_lower_bound(a,c),a),
file('GRP163-1.p',unknown),
[] ).
cnf(7,axiom,
equal(greatest_lower_bound(u,v),greatest_lower_bound(v,u)),
file('GRP163-1.p',unknown),
[] ).
cnf(8,axiom,
equal(least_upper_bound(u,v),least_upper_bound(v,u)),
file('GRP163-1.p',unknown),
[] ).
cnf(10,axiom,
equal(least_upper_bound(least_upper_bound(u,v),w),least_upper_bound(u,least_upper_bound(v,w))),
file('GRP163-1.p',unknown),
[] ).
cnf(13,axiom,
equal(least_upper_bound(u,greatest_lower_bound(u,v)),u),
file('GRP163-1.p',unknown),
[] ).
cnf(14,axiom,
equal(greatest_lower_bound(u,least_upper_bound(u,v)),u),
file('GRP163-1.p',unknown),
[] ).
cnf(42,plain,
equal(least_upper_bound(u,greatest_lower_bound(v,u)),u),
inference(spr,[status(thm),theory(equality)],[7,13]),
[iquote('0:SpR:7.0,13.0')] ).
cnf(61,plain,
equal(least_upper_bound(c,b),c),
inference(spr,[status(thm),theory(equality)],[2,42]),
[iquote('0:SpR:2.0,42.0')] ).
cnf(62,plain,
equal(least_upper_bound(b,a),b),
inference(spr,[status(thm),theory(equality)],[1,42]),
[iquote('0:SpR:1.0,42.0')] ).
cnf(68,plain,
equal(least_upper_bound(b,c),c),
inference(rew,[status(thm),theory(equality)],[8,61]),
[iquote('0:Rew:8.0,61.0')] ).
cnf(69,plain,
equal(least_upper_bound(a,b),b),
inference(rew,[status(thm),theory(equality)],[8,62]),
[iquote('0:Rew:8.0,62.0')] ).
cnf(96,plain,
equal(least_upper_bound(a,least_upper_bound(b,u)),least_upper_bound(b,u)),
inference(spr,[status(thm),theory(equality)],[69,10]),
[iquote('0:SpR:69.0,10.0')] ).
cnf(162,plain,
equal(least_upper_bound(a,c),c),
inference(spr,[status(thm),theory(equality)],[68,96]),
[iquote('0:SpR:68.0,96.0')] ).
cnf(165,plain,
equal(greatest_lower_bound(a,c),a),
inference(spr,[status(thm),theory(equality)],[162,14]),
[iquote('0:SpR:162.0,14.0')] ).
cnf(170,plain,
$false,
inference(mrr,[status(thm)],[165,3]),
[iquote('0:MRR:165.0,3.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP163-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.04/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 14 10:06:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.42
% 0.20/0.42 SPASS V 3.9
% 0.20/0.42 SPASS beiseite: Proof found.
% 0.20/0.42 % SZS status Theorem
% 0.20/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.42 SPASS derived 132 clauses, backtracked 0 clauses, performed 0 splits and kept 57 clauses.
% 0.20/0.42 SPASS allocated 63247 KBytes.
% 0.20/0.42 SPASS spent 0:00:00.06 on the problem.
% 0.20/0.42 0:00:00.03 for the input.
% 0.20/0.42 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.42 0:00:00.00 for inferences.
% 0.20/0.42 0:00:00.00 for the backtracking.
% 0.20/0.42 0:00:00.01 for the reduction.
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Here is a proof with depth 5, length 17 :
% 0.20/0.42 % SZS output start Refutation
% See solution above
% 0.20/0.42 Formulae used in the proof : ax_transb_1 ax_transb_2 prove_ax_transb symmetry_of_glb symmetry_of_lub associativity_of_lub lub_absorbtion glb_absorbtion
% 0.20/0.42
%------------------------------------------------------------------------------