%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN057-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n006.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 12:17:43 EDT 2022
% Result : Unsatisfiable 0.19s 0.42s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 14 ( 7 unt; 0 nHn; 14 RR)
% Number of literals : 26 ( 0 equ; 14 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
big(a),
file('SYN057-1.p',unknown),
[] ).
cnf(2,axiom,
~ big_g(a),
file('SYN057-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ big(u)
| big_h(u) ),
file('SYN057-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ big_i(u)
| ~ big_j(u)
| big(u) ),
file('SYN057-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ big_h(u)
| ~ big_i(u)
| ~ big_h(v)
| big_g(v) ),
file('SYN057-1.p',unknown),
[] ).
cnf(6,axiom,
big_j(b),
file('SYN057-1.p',unknown),
[] ).
cnf(7,axiom,
big_i(b),
file('SYN057-1.p',unknown),
[] ).
cnf(8,plain,
( ~ big_j(b)
| big(b) ),
inference(res,[status(thm),theory(equality)],[7,4]),
[iquote('0:Res:7.0,4.1')] ).
cnf(9,plain,
( ~ big_h(u)
| ~ big_h(b)
| big_g(u) ),
inference(res,[status(thm),theory(equality)],[7,5]),
[iquote('0:Res:7.0,5.1')] ).
cnf(11,plain,
big(b),
inference(mrr,[status(thm)],[8,6]),
[iquote('0:MRR:8.0,6.0')] ).
cnf(19,plain,
( ~ big_h(u)
| ~ big(b)
| big_g(u) ),
inference(sor,[status(thm)],[9,3]),
[iquote('0:SoR:9.1,3.1')] ).
cnf(20,plain,
( ~ big_h(u)
| big_g(u) ),
inference(ssi,[status(thm)],[19,6,7,11]),
[iquote('0:SSi:19.1,6.0,7.0,11.0')] ).
cnf(21,plain,
~ big_h(a),
inference(res,[status(thm),theory(equality)],[20,2]),
[iquote('0:Res:20.1,2.0')] ).
cnf(22,plain,
$false,
inference(ssi,[status(thm)],[21,3,1]),
[iquote('0:SSi:21.0,3.0,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN057-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n006.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 : Mon Jul 11 20:51:20 EDT 2022
% 0.13/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/sandbox2/benchmark/theBenchmark.p
% 0.19/0.42 SPASS derived 5 clauses, backtracked 0 clauses, performed 0 splits and kept 11 clauses.
% 0.19/0.42 SPASS allocated 75596 KBytes.
% 0.19/0.42 SPASS spent 0:00:00.06 on the problem.
% 0.19/0.42 0:00:00.04 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.00 for the reduction.
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 Here is a proof with depth 3, length 14 :
% 0.19/0.42 % SZS output start Refutation
% See solution above
% 0.19/0.42 Formulae used in the proof : clause_1 clause_2 clause_3 clause_4 clause_5 clause_6 clause_7
% 0.19/0.42
%------------------------------------------------------------------------------