%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SYN055-1 : TPTP v8.1.0. Released v1.0.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 : Thu Jul 21 12:17:41 EDT 2022
% Result : Unsatisfiable 0.12s 0.40s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 14 ( 5 unt; 2 nHn; 14 RR)
% Number of literals : 26 ( 0 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 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(1,axiom,
big_p(a),
file('SYN055-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ big_r(u)
| ~ big_g(u)
| ~ big(u) ),
file('SYN055-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ big_p(u)
| big(u) ),
file('SYN055-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ big_p(u)
| big_g(u) ),
file('SYN055-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ big_p(u)
| big_q(u)
| big_p(b) ),
file('SYN055-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ big_p(u)
| big_q(u)
| big_r(b) ),
file('SYN055-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ big_p(u)
| ~ big_q(u) ),
file('SYN055-1.p',unknown),
[] ).
cnf(8,plain,
( ~ big_p(u)
| big_r(b) ),
inference(mrr,[status(thm)],[6,7]),
[iquote('0:MRR:6.1,7.0')] ).
cnf(9,plain,
( ~ big_p(u)
| big_p(b) ),
inference(mrr,[status(thm)],[5,7]),
[iquote('0:MRR:5.1,7.0')] ).
cnf(10,plain,
big_r(b),
inference(res,[status(thm),theory(equality)],[1,8]),
[iquote('0:Res:1.0,8.0')] ).
cnf(11,plain,
big_p(b),
inference(res,[status(thm),theory(equality)],[1,9]),
[iquote('0:Res:1.0,9.0')] ).
cnf(19,plain,
( ~ big_p(b)
| ~ big_p(b) ),
inference(ems,[status(thm)],[2,10,4,3]),
[iquote('0:EmS:2.0,2.1,2.2,10.0,4.1,3.1')] ).
cnf(20,plain,
~ big_p(b),
inference(obv,[status(thm),theory(equality)],[19]),
[iquote('0:Obv:19.0')] ).
cnf(21,plain,
$false,
inference(ssi,[status(thm)],[20,10,11]),
[iquote('0:SSi:20.0,10.0,11.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN055-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 12 08:17:45 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.40
% 0.12/0.40 SPASS V 3.9
% 0.12/0.40 SPASS beiseite: Proof found.
% 0.12/0.40 % SZS status Theorem
% 0.12/0.40 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.40 SPASS derived 5 clauses, backtracked 0 clauses, performed 0 splits and kept 12 clauses.
% 0.12/0.40 SPASS allocated 75593 KBytes.
% 0.12/0.40 SPASS spent 0:00:00.06 on the problem.
% 0.12/0.40 0:00:00.03 for the input.
% 0.12/0.40 0:00:00.00 for the FLOTTER CNF translation.
% 0.12/0.40 0:00:00.00 for inferences.
% 0.12/0.40 0:00:00.00 for the backtracking.
% 0.12/0.40 0:00:00.00 for the reduction.
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 Here is a proof with depth 2, length 14 :
% 0.12/0.40 % SZS output start Refutation
% See solution above
% 0.12/0.40 Formulae used in the proof : clause_1 clause_2 clause_3 clause_4 clause_5 clause_6 clause_7
% 0.12/0.40
%------------------------------------------------------------------------------