TSTP Solution File: REL049-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : REL049-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n018.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:02:31 EDT 2022
% Result : Unsatisfiable 0.19s 0.42s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 11 RR)
% Number of literals : 11 ( 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 : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(join(sk1,sk2),sk2),
file('REL049-1.p',unknown),
[] ).
cnf(2,axiom,
equal(join(sk3,sk2),sk2),
file('REL049-1.p',unknown),
[] ).
cnf(3,axiom,
~ equal(join(join(sk1,sk3),sk2),sk2),
file('REL049-1.p',unknown),
[] ).
cnf(4,axiom,
equal(join(u,v),join(v,u)),
file('REL049-1.p',unknown),
[] ).
cnf(5,axiom,
equal(join(join(u,v),w),join(u,join(v,w))),
file('REL049-1.p',unknown),
[] ).
cnf(17,plain,
equal(join(sk2,sk3),sk2),
inference(rew,[status(thm),theory(equality)],[4,2]),
[iquote('0:Rew:4.0,2.0')] ).
cnf(18,plain,
~ equal(join(sk2,join(sk1,sk3)),sk2),
inference(rew,[status(thm),theory(equality)],[4,3]),
[iquote('0:Rew:4.0,3.0')] ).
cnf(183,plain,
equal(join(u,join(v,w)),join(w,join(u,v))),
inference(spr,[status(thm),theory(equality)],[5,4]),
[iquote('0:SpR:5.0,4.0')] ).
cnf(198,plain,
~ equal(join(sk1,join(sk3,sk2)),sk2),
inference(rew,[status(thm),theory(equality)],[183,18]),
[iquote('0:Rew:183.0,18.0')] ).
cnf(202,plain,
~ equal(sk2,sk2),
inference(rew,[status(thm),theory(equality)],[1,198,17,4]),
[iquote('0:Rew:1.0,198.0,17.0,198.0,4.0,198.0')] ).
cnf(203,plain,
$false,
inference(obv,[status(thm),theory(equality)],[202]),
[iquote('0:Obv:202.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : REL049-1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n018.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 : 600
% 0.12/0.33 % DateTime : Fri Jul 8 10:03:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.42
% 0.19/0.42 SPASS V 3.9
% 0.19/0.42 SPASS beiseite: Proof found.
% 0.19/0.42 % SZS status Theorem
% 0.19/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.42 SPASS derived 133 clauses, backtracked 0 clauses, performed 0 splits and kept 72 clauses.
% 0.19/0.42 SPASS allocated 63366 KBytes.
% 0.19/0.42 SPASS spent 0:00:00.07 on the problem.
% 0.19/0.42 0:00:00.03 for the input.
% 0.19/0.42 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.42 0:00:00.00 for inferences.
% 0.19/0.42 0:00:00.00 for the backtracking.
% 0.19/0.42 0:00:00.01 for the reduction.
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 Here is a proof with depth 1, length 11 :
% 0.19/0.42 % SZS output start Refutation
% See solution above
% 0.19/0.42 Formulae used in the proof : goals_14 goals_15 goals_16 maddux1_join_commutativity_1 maddux2_join_associativity_2
% 0.19/0.42
%------------------------------------------------------------------------------