TSTP Solution File: SWC026-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC026-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n019.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 : Tue Jul 19 22:01:11 EDT 2022
% Result : Unsatisfiable 0.20s 0.45s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of clauses : 14 ( 6 unt; 2 nHn; 14 RR)
% Number of literals : 22 ( 0 equ; 8 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
equal(sk2,sk4),
file('SWC026-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk1,sk3),
file('SWC026-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ equal(nil,sk3)
| equal(nil,sk4) ),
file('SWC026-1.p',unknown),
[] ).
cnf(8,axiom,
( ~ equal(nil,sk4)
| equal(nil,sk3) ),
file('SWC026-1.p',unknown),
[] ).
cnf(9,axiom,
( equal(nil,sk2)
| equal(nil,sk1) ),
file('SWC026-1.p',unknown),
[] ).
cnf(12,axiom,
( ~ equal(nil,sk1)
| ~ equal(nil,sk2) ),
file('SWC026-1.p',unknown),
[] ).
cnf(200,plain,
( equal(nil,sk4)
| equal(nil,sk3) ),
inference(rew,[status(thm),theory(equality)],[6,9,5]),
[iquote('0:Rew:6.0,9.1,5.0,9.0')] ).
cnf(201,plain,
( ~ equal(sk4,sk4)
| equal(nil,sk3) ),
inference(rew,[status(thm),theory(equality)],[200,8]),
[iquote('0:Rew:200.0,8.0')] ).
cnf(202,plain,
equal(nil,sk3),
inference(obv,[status(thm),theory(equality)],[201]),
[iquote('0:Obv:201.0')] ).
cnf(223,plain,
( ~ equal(sk3,sk3)
| equal(sk4,sk3) ),
inference(rew,[status(thm),theory(equality)],[202,7]),
[iquote('0:Rew:202.0,7.1,202.0,7.0')] ).
cnf(224,plain,
equal(sk4,sk3),
inference(obv,[status(thm),theory(equality)],[223]),
[iquote('0:Obv:223.0')] ).
cnf(226,plain,
equal(sk2,sk3),
inference(rew,[status(thm),theory(equality)],[224,5]),
[iquote('0:Rew:224.0,5.0')] ).
cnf(229,plain,
( ~ equal(sk3,sk3)
| ~ equal(sk3,sk3) ),
inference(rew,[status(thm),theory(equality)],[202,12,226,6]),
[iquote('0:Rew:202.0,12.1,226.0,12.1,202.0,12.0,6.0,12.0')] ).
cnf(230,plain,
$false,
inference(obv,[status(thm),theory(equality)],[229]),
[iquote('0:Obv:229.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWC026-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.14 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 12 16:38:10 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.45
% 0.20/0.45 SPASS V 3.9
% 0.20/0.45 SPASS beiseite: Proof found.
% 0.20/0.45 % SZS status Theorem
% 0.20/0.45 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45 SPASS derived 24 clauses, backtracked 0 clauses, performed 0 splits and kept 104 clauses.
% 0.20/0.45 SPASS allocated 75868 KBytes.
% 0.20/0.45 SPASS spent 0:00:00.08 on the problem.
% 0.20/0.45 0:00:00.04 for the input.
% 0.20/0.45 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.45 0:00:00.00 for inferences.
% 0.20/0.45 0:00:00.00 for the backtracking.
% 0.20/0.45 0:00:00.01 for the reduction.
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 Here is a proof with depth 0, length 14 :
% 0.20/0.45 % SZS output start Refutation
% See solution above
% 0.20/0.45 Formulae used in the proof : co1_5 co1_6 co1_7 co1_8 co1_9 co1_12
% 0.20/0.45
%------------------------------------------------------------------------------