TSTP Solution File: SWC375-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWC375-1 : TPTP v8.1.0. Released v2.4.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 : Tue Jul 19 22:03:39 EDT 2022
% Result : Unsatisfiable 0.21s 0.44s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 8 unt; 2 nHn; 12 RR)
% Number of literals : 16 ( 0 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 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(sk4,sk2),
file('SWC375-1.p',unknown),
[] ).
cnf(6,axiom,
equal(sk3,sk1),
file('SWC375-1.p',unknown),
[] ).
cnf(7,axiom,
equal(sk4,sk3),
file('SWC375-1.p',unknown),
[] ).
cnf(9,axiom,
( memberP(sk2,sk5)
| memberP(sk1,sk5) ),
file('SWC375-1.p',unknown),
[] ).
cnf(10,axiom,
( ~ memberP(sk2,sk5)
| ~ memberP(sk1,sk5) ),
file('SWC375-1.p',unknown),
[] ).
cnf(198,plain,
equal(sk4,sk1),
inference(rew,[status(thm),theory(equality)],[6,7]),
[iquote('0:Rew:6.0,7.0')] ).
cnf(199,plain,
equal(sk2,sk1),
inference(rew,[status(thm),theory(equality)],[5,198]),
[iquote('0:Rew:5.0,198.0')] ).
cnf(202,plain,
( memberP(sk1,sk5)
| memberP(sk1,sk5) ),
inference(rew,[status(thm),theory(equality)],[199,9]),
[iquote('0:Rew:199.0,9.0')] ).
cnf(203,plain,
memberP(sk1,sk5),
inference(obv,[status(thm),theory(equality)],[202]),
[iquote('0:Obv:202.0')] ).
cnf(204,plain,
( ~ memberP(sk1,sk5)
| ~ memberP(sk1,sk5) ),
inference(rew,[status(thm),theory(equality)],[199,10]),
[iquote('0:Rew:199.0,10.0')] ).
cnf(205,plain,
~ memberP(sk1,sk5),
inference(obv,[status(thm),theory(equality)],[204]),
[iquote('0:Obv:204.0')] ).
cnf(206,plain,
$false,
inference(mrr,[status(thm)],[205,203]),
[iquote('0:MRR:205.0,203.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC375-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n018.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jun 12 17:11:56 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.44
% 0.21/0.44 SPASS V 3.9
% 0.21/0.44 SPASS beiseite: Proof found.
% 0.21/0.44 % SZS status Theorem
% 0.21/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.44 SPASS derived 5 clauses, backtracked 0 clauses, performed 0 splits and kept 86 clauses.
% 0.21/0.44 SPASS allocated 75859 KBytes.
% 0.21/0.44 SPASS spent 0:00:00.08 on the problem.
% 0.21/0.44 0:00:00.04 for the input.
% 0.21/0.44 0:00:00.00 for the FLOTTER CNF translation.
% 0.21/0.44 0:00:00.00 for inferences.
% 0.21/0.44 0:00:00.00 for the backtracking.
% 0.21/0.44 0:00:00.00 for the reduction.
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 Here is a proof with depth 0, length 12 :
% 0.21/0.44 % SZS output start Refutation
% See solution above
% 0.21/0.44 Formulae used in the proof : co1_5 co1_6 co1_7 co1_9 co1_10
% 0.21/0.44
%------------------------------------------------------------------------------