%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : CSR066+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n025.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 : Fri Jul 15 23:24:56 EDT 2022
% Result : Theorem 0.18s 0.44s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 14 ( 6 unt; 0 nHn; 14 RR)
% Number of literals : 24 ( 0 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-4 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
shavingrazor_manual(c_theprototypicalshavingrazor_manual),
file('CSR066+1.p',unknown),
[] ).
cnf(12,axiom,
relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),
file('CSR066+1.p',unknown),
[] ).
cnf(31,axiom,
( ~ shavingrazor_manual(u)
| isa(u,c_shavingrazor_manual) ),
file('CSR066+1.p',unknown),
[] ).
cnf(32,axiom,
( ~ isa(u,c_tptpcol_16_25972)
| tptpcol_16_25972(u) ),
file('CSR066+1.p',unknown),
[] ).
cnf(53,axiom,
( ~ tptpcol_16_25972(u)
| ~ tptp_8_271(u,c_theprototypicalshavingrazor_manual) ),
file('CSR066+1.p',unknown),
[] ).
cnf(65,axiom,
( ~ shavingrazor_manual(u)
| tptp_8_271(f_relationexistsallfn(u,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual),u) ),
file('CSR066+1.p',unknown),
[] ).
cnf(75,axiom,
( ~ isa(u,v)
| ~ relationexistsall(w,x,v)
| isa(f_relationexistsallfn(u,w,x,v),x) ),
file('CSR066+1.p',unknown),
[] ).
cnf(129,plain,
( ~ shavingrazor_manual(c_theprototypicalshavingrazor_manual)
| ~ tptpcol_16_25972(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual)) ),
inference(res,[status(thm),theory(equality)],[65,53]),
[iquote('0:Res:65.1,53.1')] ).
cnf(130,plain,
~ tptpcol_16_25972(f_relationexistsallfn(c_theprototypicalshavingrazor_manual,c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual)),
inference(ssi,[status(thm)],[129,2]),
[iquote('0:SSi:129.0,2.0')] ).
cnf(196,plain,
( ~ isa(u,v)
| ~ relationexistsall(w,c_tptpcol_16_25972,v)
| tptpcol_16_25972(f_relationexistsallfn(u,w,c_tptpcol_16_25972,v)) ),
inference(res,[status(thm),theory(equality)],[75,32]),
[iquote('0:Res:75.2,32.0')] ).
cnf(200,plain,
( ~ relationexistsall(c_tptp_8_271,c_tptpcol_16_25972,c_shavingrazor_manual)
| ~ isa(c_theprototypicalshavingrazor_manual,c_shavingrazor_manual) ),
inference(sor,[status(thm)],[130,196]),
[iquote('0:SoR:130.0,196.2')] ).
cnf(201,plain,
~ isa(c_theprototypicalshavingrazor_manual,c_shavingrazor_manual),
inference(mrr,[status(thm)],[200,12]),
[iquote('0:MRR:200.0,12.0')] ).
cnf(202,plain,
~ shavingrazor_manual(c_theprototypicalshavingrazor_manual),
inference(res,[status(thm),theory(equality)],[31,201]),
[iquote('0:Res:31.1,201.0')] ).
cnf(203,plain,
$false,
inference(ssi,[status(thm)],[202,2]),
[iquote('0:SSi:202.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR066+1 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n025.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 : Fri Jun 10 01:41:51 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44
% 0.18/0.44 SPASS V 3.9
% 0.18/0.44 SPASS beiseite: Proof found.
% 0.18/0.44 % SZS status Theorem
% 0.18/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 SPASS derived 90 clauses, backtracked 0 clauses, performed 0 splits and kept 102 clauses.
% 0.18/0.44 SPASS allocated 97762 KBytes.
% 0.18/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.18/0.44 0:00:00.04 for the input.
% 0.18/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.44 0:00:00.00 for inferences.
% 0.18/0.44 0:00:00.00 for the backtracking.
% 0.18/0.44 0:00:00.00 for the reduction.
% 0.18/0.44
% 0.18/0.44
% 0.18/0.44 Here is a proof with depth 3, length 14 :
% 0.18/0.44 % SZS output start Refutation
% See solution above
% 0.18/0.44 Formulae used in the proof : just11 just10 just31 just32 query66 just9 just4
% 0.18/0.44
%------------------------------------------------------------------------------