TSTP Solution File: REL008-3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : REL008-3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n015.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 : Mon Jul 18 20:01:32 EDT 2022
% Result : Unsatisfiable 88.84s 89.05s
% Output : Refutation 88.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 16 RR)
% Number of literals : 16 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ equal(join(composition(sk1,sk2),composition(sk1,sk3)),composition(sk1,join(sk2,sk3))),
file('REL008-3.p',unknown),
[] ).
cnf(8,axiom,
equal(join(composition(u,v),composition(w,v)),composition(join(u,w),v)),
file('REL008-3.p',unknown),
[] ).
cnf(9,axiom,
equal(converse(converse(u)),u),
file('REL008-3.p',unknown),
[] ).
cnf(10,axiom,
equal(join(converse(u),converse(v)),converse(join(u,v))),
file('REL008-3.p',unknown),
[] ).
cnf(11,axiom,
equal(composition(converse(u),converse(v)),converse(composition(v,u))),
file('REL008-3.p',unknown),
[] ).
cnf(31,plain,
equal(converse(composition(u,converse(v))),composition(v,converse(u))),
inference(spr,[status(thm),theory(equality)],[9,11]),
[iquote('0:SpR:9.0,11.0')] ).
cnf(35,plain,
equal(converse(join(u,converse(v))),join(converse(u),v)),
inference(spr,[status(thm),theory(equality)],[9,10]),
[iquote('0:SpR:9.0,10.0')] ).
cnf(265,plain,
equal(join(converse(composition(u,v)),composition(w,converse(u))),composition(join(converse(v),w),converse(u))),
inference(spr,[status(thm),theory(equality)],[11,8]),
[iquote('0:SpR:11.0,8.0')] ).
cnf(925,plain,
equal(join(converse(u),composition(v,converse(w))),converse(join(u,composition(w,converse(v))))),
inference(spr,[status(thm),theory(equality)],[31,10]),
[iquote('0:SpR:31.0,10.0')] ).
cnf(948,plain,
equal(converse(join(composition(u,v),composition(u,converse(w)))),composition(join(converse(v),w),converse(u))),
inference(rew,[status(thm),theory(equality)],[925,265]),
[iquote('0:Rew:925.0,265.0')] ).
cnf(1013,plain,
equal(composition(join(converse(u),v),converse(w)),converse(composition(w,join(u,converse(v))))),
inference(spr,[status(thm),theory(equality)],[35,11]),
[iquote('0:SpR:35.0,11.0')] ).
cnf(1053,plain,
equal(converse(join(composition(u,v),composition(u,converse(w)))),converse(composition(u,join(v,converse(w))))),
inference(rew,[status(thm),theory(equality)],[1013,948]),
[iquote('0:Rew:1013.0,948.0')] ).
cnf(5914,plain,
equal(converse(join(composition(u,v),composition(u,w))),converse(composition(u,join(v,w)))),
inference(spr,[status(thm),theory(equality)],[9,1053]),
[iquote('0:SpR:9.0,1053.0')] ).
cnf(116008,plain,
equal(join(composition(u,v),composition(u,w)),converse(converse(composition(u,join(v,w))))),
inference(spr,[status(thm),theory(equality)],[5914,9]),
[iquote('0:SpR:5914.0,9.0')] ).
cnf(116286,plain,
equal(join(composition(u,v),composition(u,w)),composition(u,join(v,w))),
inference(rew,[status(thm),theory(equality)],[9,116008]),
[iquote('0:Rew:9.0,116008.0')] ).
cnf(116287,plain,
$false,
inference(unc,[status(thm)],[116286,1]),
[iquote('0:UnC:116286.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : REL008-3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n015.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 : Fri Jul 8 10:52:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 88.84/89.05
% 88.84/89.05 SPASS V 3.9
% 88.84/89.05 SPASS beiseite: Proof found.
% 88.84/89.05 % SZS status Theorem
% 88.84/89.05 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 88.84/89.05 SPASS derived 70199 clauses, backtracked 0 clauses, performed 0 splits and kept 9068 clauses.
% 88.84/89.05 SPASS allocated 181427 KBytes.
% 88.84/89.05 SPASS spent 0:1:25.49 on the problem.
% 88.84/89.05 0:00:00.04 for the input.
% 88.84/89.05 0:00:00.00 for the FLOTTER CNF translation.
% 88.84/89.05 0:00:00.54 for inferences.
% 88.84/89.05 0:00:00.00 for the backtracking.
% 88.84/89.05 0:1:24.78 for the reduction.
% 88.84/89.05
% 88.84/89.05
% 88.84/89.05 Here is a proof with depth 3, length 16 :
% 88.84/89.05 % SZS output start Refutation
% See solution above
% 88.84/89.05 Formulae used in the proof : goals_17 composition_distributivity_7 converse_idempotence_8 converse_additivity_9 converse_multiplicativity_10
% 88.84/89.05
%------------------------------------------------------------------------------