TSTP Solution File: GRP141-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GRP141-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n016.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:54 EDT 2022
% Result : Unsatisfiable 0.20s 0.42s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 18 RR)
% Number of literals : 18 ( 0 equ; 4 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(least_upper_bound(a,c),a),
file('GRP141-1.p',unknown),
[] ).
cnf(2,axiom,
equal(least_upper_bound(b,c),b),
file('GRP141-1.p',unknown),
[] ).
cnf(3,axiom,
~ equal(greatest_lower_bound(greatest_lower_bound(a,b),c),c),
file('GRP141-1.p',unknown),
[] ).
cnf(7,axiom,
equal(greatest_lower_bound(u,v),greatest_lower_bound(v,u)),
file('GRP141-1.p',unknown),
[] ).
cnf(8,axiom,
equal(least_upper_bound(u,v),least_upper_bound(v,u)),
file('GRP141-1.p',unknown),
[] ).
cnf(9,axiom,
equal(greatest_lower_bound(greatest_lower_bound(u,v),w),greatest_lower_bound(u,greatest_lower_bound(v,w))),
file('GRP141-1.p',unknown),
[] ).
cnf(14,axiom,
equal(greatest_lower_bound(u,least_upper_bound(u,v)),u),
file('GRP141-1.p',unknown),
[] ).
cnf(19,plain,
equal(least_upper_bound(c,b),b),
inference(rew,[status(thm),theory(equality)],[8,2]),
[iquote('0:Rew:8.0,2.0')] ).
cnf(20,plain,
~ equal(greatest_lower_bound(c,greatest_lower_bound(a,b)),c),
inference(rew,[status(thm),theory(equality)],[7,3]),
[iquote('0:Rew:7.0,3.0')] ).
cnf(29,plain,
equal(greatest_lower_bound(c,b),c),
inference(spr,[status(thm),theory(equality)],[19,14]),
[iquote('0:SpR:19.0,14.0')] ).
cnf(38,plain,
equal(greatest_lower_bound(u,least_upper_bound(v,u)),u),
inference(spr,[status(thm),theory(equality)],[8,14]),
[iquote('0:SpR:8.0,14.0')] ).
cnf(56,plain,
equal(greatest_lower_bound(c,a),c),
inference(spr,[status(thm),theory(equality)],[1,38]),
[iquote('0:SpR:1.0,38.0')] ).
cnf(62,plain,
equal(greatest_lower_bound(a,c),c),
inference(rew,[status(thm),theory(equality)],[7,56]),
[iquote('0:Rew:7.0,56.0')] ).
cnf(256,plain,
equal(greatest_lower_bound(greatest_lower_bound(u,v),w),greatest_lower_bound(v,greatest_lower_bound(u,w))),
inference(spr,[status(thm),theory(equality)],[7,9]),
[iquote('0:SpR:7.0,9.0')] ).
cnf(263,plain,
equal(greatest_lower_bound(u,greatest_lower_bound(v,w)),greatest_lower_bound(v,greatest_lower_bound(u,w))),
inference(rew,[status(thm),theory(equality)],[9,256]),
[iquote('0:Rew:9.0,256.0')] ).
cnf(264,plain,
~ equal(greatest_lower_bound(a,greatest_lower_bound(c,b)),c),
inference(rew,[status(thm),theory(equality)],[263,20]),
[iquote('0:Rew:263.0,20.0')] ).
cnf(265,plain,
~ equal(c,c),
inference(rew,[status(thm),theory(equality)],[62,264,29]),
[iquote('0:Rew:62.0,264.0,29.0,264.0')] ).
cnf(266,plain,
$false,
inference(obv,[status(thm),theory(equality)],[265]),
[iquote('0:Obv:265.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP141-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n016.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 02:27:30 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 208 clauses, backtracked 0 clauses, performed 0 splits and kept 62 clauses.
% 0.20/0.42 SPASS allocated 63323 KBytes.
% 0.20/0.42 SPASS spent 0:00:00.07 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 2, length 18 :
% 0.20/0.42 % SZS output start Refutation
% See solution above
% 0.20/0.42 Formulae used in the proof : ax_glb1d_1 ax_glb1d_2 prove_ax_glb1d symmetry_of_glb symmetry_of_lub associativity_of_glb glb_absorbtion
% 0.20/0.42
%------------------------------------------------------------------------------