TSTP Solution File: SYO580+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYO580+1 : TPTP v8.1.0. Released v5.5.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n013.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 : Thu Jul 21 19:54:48 EDT 2022
% Result : Theorem 1.31s 1.47s
% Output : Refutation 1.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 10 ( 5 unt; 1 nHn; 10 RR)
% Number of literals : 16 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
b48_buttercup10305(skc516),
file('SYO580+1.p',unknown),
[] ).
cnf(605,axiom,
( b48_buttercup10305(skc514)
| k04_buttercup10303(skc514) ),
file('SYO580+1.p',unknown),
[] ).
cnf(961,axiom,
( ~ b48_buttercup10305(u)
| k04_buttercup10303(u) ),
file('SYO580+1.p',unknown),
[] ).
cnf(1275,axiom,
( ~ b48_buttercup10305(skc514)
| ~ k04_buttercup10303(skc514) ),
file('SYO580+1.p',unknown),
[] ).
cnf(1289,axiom,
( ~ k04_buttercup10303(u)
| ~ k04_buttercup10303(skc516)
| b48_buttercup10305(u) ),
file('SYO580+1.p',unknown),
[] ).
cnf(1314,plain,
k04_buttercup10303(skc514),
inference(mrr,[status(thm)],[605,961]),
[iquote('0:MRR:605.0,961.0')] ).
cnf(1315,plain,
~ b48_buttercup10305(skc514),
inference(mrr,[status(thm)],[1275,1314]),
[iquote('0:MRR:1275.1,1314.0')] ).
cnf(1323,plain,
k04_buttercup10303(skc516),
inference(res,[status(thm),theory(equality)],[2,961]),
[iquote('0:Res:2.0,961.0')] ).
cnf(1326,plain,
( ~ k04_buttercup10303(skc516)
| b48_buttercup10305(skc514) ),
inference(res,[status(thm),theory(equality)],[1314,1289]),
[iquote('0:Res:1314.0,1289.0')] ).
cnf(1341,plain,
$false,
inference(mrr,[status(thm)],[1326,1323,1315]),
[iquote('0:MRR:1326.0,1326.1,1323.0,1315.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO580+1 : TPTP v8.1.0. Released v5.5.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n013.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 : Sat Jul 9 12:14:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.31/1.47
% 1.31/1.47 SPASS V 3.9
% 1.31/1.47 SPASS beiseite: Proof found.
% 1.31/1.47 % SZS status Theorem
% 1.31/1.47 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.31/1.47 SPASS derived 25 clauses, backtracked 0 clauses, performed 0 splits and kept 1323 clauses.
% 1.31/1.47 SPASS allocated 100101 KBytes.
% 1.31/1.47 SPASS spent 0:00:01.08 on the problem.
% 1.31/1.47 0:00:00.05 for the input.
% 1.31/1.47 0:00:00.34 for the FLOTTER CNF translation.
% 1.31/1.47 0:00:00.00 for inferences.
% 1.31/1.47 0:00:00.00 for the backtracking.
% 1.31/1.47 0:00:00.30 for the reduction.
% 1.31/1.47
% 1.31/1.47
% 1.31/1.47 Here is a proof with depth 1, length 10 :
% 1.31/1.47 % SZS output start Refutation
% See solution above
% 1.31/1.47 Formulae used in the proof : goals_886 sos_578 sos_749 sos_320
% 1.31/1.47
%------------------------------------------------------------------------------