TSTP Solution File: SEU152+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU152+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n010.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 14:34:24 EDT 2022
% Result : Theorem 0.22s 0.45s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 11 ( 7 unt; 0 nHn; 11 RR)
% Number of literals : 15 ( 0 equ; 8 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
in(skc2,skc3),
file('SEU152+1.p',unknown),
[] ).
cnf(4,axiom,
~ equal(set_union2(singleton(skc2),skc3),skc3),
file('SEU152+1.p',unknown),
[] ).
cnf(5,axiom,
equal(set_union2(u,v),set_union2(v,u)),
file('SEU152+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ in(u,v)
| subset(singleton(u),v) ),
file('SEU152+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ subset(u,v)
| equal(set_union2(u,v),v) ),
file('SEU152+1.p',unknown),
[] ).
cnf(10,plain,
~ equal(set_union2(skc3,singleton(skc2)),skc3),
inference(rew,[status(thm),theory(equality)],[5,4]),
[iquote('0:Rew:5.0,4.0')] ).
cnf(12,plain,
subset(singleton(skc2),skc3),
inference(res,[status(thm),theory(equality)],[1,8]),
[iquote('0:Res:1.0,8.0')] ).
cnf(27,plain,
( ~ subset(u,v)
| equal(set_union2(v,u),v) ),
inference(spr,[status(thm),theory(equality)],[9,5]),
[iquote('0:SpR:9.1,5.0')] ).
cnf(36,plain,
( ~ subset(singleton(skc2),skc3)
| ~ equal(skc3,skc3) ),
inference(spl,[status(thm),theory(equality)],[27,10]),
[iquote('0:SpL:27.1,10.0')] ).
cnf(37,plain,
~ subset(singleton(skc2),skc3),
inference(obv,[status(thm),theory(equality)],[36]),
[iquote('0:Obv:36.1')] ).
cnf(38,plain,
$false,
inference(mrr,[status(thm)],[37,12]),
[iquote('0:MRR:37.0,12.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : SEU152+1 : TPTP v8.1.0. Released v3.3.0.
% 0.09/0.14 % Command : run_spass %d %s
% 0.14/0.36 % Computer : n010.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jun 20 02:38:52 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.22/0.45
% 0.22/0.45 SPASS V 3.9
% 0.22/0.45 SPASS beiseite: Proof found.
% 0.22/0.45 % SZS status Theorem
% 0.22/0.45 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.45 SPASS derived 26 clauses, backtracked 0 clauses, performed 0 splits and kept 17 clauses.
% 0.22/0.45 SPASS allocated 85074 KBytes.
% 0.22/0.45 SPASS spent 0:00:00.08 on the problem.
% 0.22/0.45 0:00:00.03 for the input.
% 0.22/0.45 0:00:00.02 for the FLOTTER CNF translation.
% 0.22/0.45 0:00:00.00 for inferences.
% 0.22/0.45 0:00:00.00 for the backtracking.
% 0.22/0.45 0:00:00.00 for the reduction.
% 0.22/0.45
% 0.22/0.45
% 0.22/0.45 Here is a proof with depth 2, length 11 :
% 0.22/0.45 % SZS output start Refutation
% See solution above
% 0.22/0.45 Formulae used in the proof : l23_zfmisc_1 commutativity_k2_xboole_0 l2_zfmisc_1 t12_xboole_1
% 0.22/0.45
%------------------------------------------------------------------------------