TSTP Solution File: MGT012+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : MGT012+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n023.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:24:16 EDT 2022
% Result : Theorem 0.20s 0.39s
% Output : Proof 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
organization(sK2,sK5),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_FOL)]) ).
cnf(g1,plain,
organization(sK2,sK6),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_FOL)]) ).
cnf(g2,plain,
reorganization_free(sK2,sK5,sK6),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_FOL)]) ).
cnf(g3,plain,
complexity(sK2,sK3,sK5),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_FOL)]) ).
cnf(g4,plain,
complexity(sK2,sK4,sK6),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_FOL)]) ).
cnf(g5,plain,
greater(sK6,sK5),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_FOL)]) ).
cnf(g6,plain,
greater(sK3,sK4),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_FOL)]) ).
cnf(g7,plain,
( ~ organization(sK2,sK5)
| inertia(sK2,sK0(sK2,sK5),sK5) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp5)]) ).
cnf(g8,plain,
( ~ organization(sK2,sK5)
| class(sK2,sK1(sK2,sK5),sK5) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp9)]) ).
cnf(g9,plain,
( ~ organization(sK2,sK6)
| inertia(sK2,sK0(sK2,sK6),sK6) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp5)]) ).
cnf(g10,plain,
( ~ organization(sK2,sK6)
| class(sK2,sK1(sK2,sK6),sK6) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp9)]) ).
cnf(g11,plain,
sPE(sK2,sK2),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ organization(sK2,sK5)
| ~ organization(sK2,sK6)
| ~ inertia(sK2,sK0(sK2,sK5),sK5)
| ~ inertia(sK2,sK0(sK2,sK6),sK6)
| ~ greater(sK6,sK5)
| ~ reorganization_free(sK2,sK5,sK6)
| greater(sK0(sK2,sK6),sK0(sK2,sK5)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_FOL)]) ).
cnf(g13,plain,
( ~ greater(sK0(sK2,sK5),sK0(sK2,sK6))
| ~ greater(sK0(sK2,sK6),sK0(sK2,sK5)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp6_2)]) ).
cnf(g14,plain,
( ~ organization(sK2,sK5)
| ~ organization(sK2,sK6)
| ~ class(sK2,sK1(sK2,sK5),sK5)
| ~ class(sK2,sK1(sK2,sK6),sK6)
| ~ reorganization_free(sK2,sK5,sK6)
| sPE(sK1(sK2,sK5),sK1(sK2,sK6)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp10)]) ).
cnf(g15,plain,
sPE(sK5,sK5),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ organization(sK2,sK6)
| ~ organization(sK2,sK5)
| ~ inertia(sK2,sK0(sK2,sK6),sK6)
| ~ inertia(sK2,sK0(sK2,sK5),sK5)
| ~ greater(sK3,sK4)
| ~ class(sK2,sK1(sK2,sK6),sK6)
| ~ class(sK2,sK1(sK2,sK6),sK5)
| ~ complexity(sK2,sK4,sK6)
| ~ complexity(sK2,sK3,sK5)
| greater(sK0(sK2,sK5),sK0(sK2,sK6)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',a12_FOL)]) ).
cnf(g17,plain,
( ~ sPE(sK2,sK2)
| ~ sPE(sK1(sK2,sK5),sK1(sK2,sK6))
| ~ sPE(sK5,sK5)
| ~ class(sK2,sK1(sK2,sK5),sK5)
| class(sK2,sK1(sK2,sK6),sK5) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT012+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : satcop --statistics %s
% 0.13/0.34 % Computer : n023.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 11:07:08 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.39 % symbols: 15
% 0.20/0.39 % clauses: 25
% 0.20/0.39 % start clauses: 7
% 0.20/0.39 % iterative deepening steps: 279
% 0.20/0.39 % maximum path limit: 2
% 0.20/0.39 % literal attempts: 79951
% 0.20/0.39 % depth failures: 50075
% 0.20/0.39 % regularity failures: 2
% 0.20/0.39 % tautology failures: 1703
% 0.20/0.39 % reductions: 6614
% 0.20/0.39 % extensions: 71513
% 0.20/0.39 % SAT variables: 1633
% 0.20/0.39 % SAT clauses: 4656
% 0.20/0.39 % WalkSAT solutions: 4655
% 0.20/0.39 % CDCL solutions: 0
% 0.20/0.39 % SZS status Theorem for theBenchmark
% 0.20/0.39 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------