TSTP Solution File: MGT041-2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : MGT041-2 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n020.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 : Sun Jul 17 22:26:24 EDT 2022
% Result : Unsatisfiable 0.20s 0.41s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 16 ( 9 unt; 2 nHn; 16 RR)
% Number of literals : 30 ( 0 equ; 17 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ number_of_routines(u,v,high)
| ~ number_of_routines(u,v,low) ),
file('MGT041-2.p',unknown),
[] ).
cnf(2,axiom,
( ~ efficient_producer(u)
| ~ founding_time(u,v)
| ~ organisation_at_time(u,v)
| has_elaborated_routines(u,v) ),
file('MGT041-2.p',unknown),
[] ).
cnf(3,axiom,
( ~ first_mover(u)
| ~ founding_time(u,v)
| ~ organisation_at_time(u,v)
| number_of_routines(u,v,low) ),
file('MGT041-2.p',unknown),
[] ).
cnf(4,axiom,
organisation_at_time(sk1,sk2),
file('MGT041-2.p',unknown),
[] ).
cnf(5,axiom,
founding_time(sk1,sk2),
file('MGT041-2.p',unknown),
[] ).
cnf(6,axiom,
number_of_routines(sk1,sk2,high),
file('MGT041-2.p',unknown),
[] ).
cnf(7,axiom,
~ has_elaborated_routines(sk1,sk2),
file('MGT041-2.p',unknown),
[] ).
cnf(8,axiom,
( ~ organisation_at_time(u,v)
| efficient_producer(u)
| first_mover(u) ),
file('MGT041-2.p',unknown),
[] ).
cnf(9,plain,
( efficient_producer(sk1)
| first_mover(sk1) ),
inference(res,[status(thm),theory(equality)],[4,8]),
[iquote('0:Res:4.0,8.0')] ).
cnf(15,plain,
~ number_of_routines(sk1,sk2,low),
inference(res,[status(thm),theory(equality)],[6,1]),
[iquote('0:Res:6.0,1.0')] ).
cnf(16,plain,
( ~ efficient_producer(sk1)
| ~ organisation_at_time(sk1,sk2)
| has_elaborated_routines(sk1,sk2) ),
inference(res,[status(thm),theory(equality)],[5,2]),
[iquote('0:Res:5.0,2.1')] ).
cnf(17,plain,
~ efficient_producer(sk1),
inference(mrr,[status(thm)],[16,4,7]),
[iquote('0:MRR:16.1,16.2,4.0,7.0')] ).
cnf(18,plain,
first_mover(sk1),
inference(mrr,[status(thm)],[9,17]),
[iquote('0:MRR:9.0,17.0')] ).
cnf(19,plain,
( ~ first_mover(sk1)
| ~ organisation_at_time(sk1,sk2)
| number_of_routines(sk1,sk2,low) ),
inference(res,[status(thm),theory(equality)],[5,3]),
[iquote('0:Res:5.0,3.1')] ).
cnf(20,plain,
~ first_mover(sk1),
inference(mrr,[status(thm)],[19,4,15]),
[iquote('0:MRR:19.1,19.2,4.0,15.0')] ).
cnf(21,plain,
$false,
inference(mrr,[status(thm)],[20,18]),
[iquote('0:MRR:20.0,18.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : MGT041-2 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n020.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 : Thu Jun 9 07:29:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.41
% 0.20/0.41 SPASS V 3.9
% 0.20/0.41 SPASS beiseite: Proof found.
% 0.20/0.41 % SZS status Theorem
% 0.20/0.41 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.41 SPASS derived 6 clauses, backtracked 0 clauses, performed 0 splits and kept 13 clauses.
% 0.20/0.41 SPASS allocated 75586 KBytes.
% 0.20/0.41 SPASS spent 0:00:00.05 on the problem.
% 0.20/0.41 0:00:00.04 for the input.
% 0.20/0.41 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.41 0:00:00.00 for inferences.
% 0.20/0.41 0:00:00.00 for the backtracking.
% 0.20/0.41 0:00:00.00 for the reduction.
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Here is a proof with depth 1, length 16 :
% 0.20/0.41 % SZS output start Refutation
% See solution above
% 0.20/0.41 Formulae used in the proof : mp_not_high_and_low_1 a14_2 a15_3 a16_4 a16_5 a16_6 a16_7 prove_t10_8
% 0.20/0.41
%------------------------------------------------------------------------------