TSTP Solution File: REL003+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : REL003+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n014.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 : Mon Jul 18 19:57:58 EDT 2022
% Result : Theorem 0.12s 0.37s
% Output : Proof 0.12s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
( sPE(join(sK0,sK1),sK1)
| sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals)]) ).
cnf(g1,plain,
( ~ sPE(join(converse(sK0),converse(sK1)),converse(sK1))
| sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals)]) ).
cnf(g2,plain,
( ~ sPE(join(sK0,sK1),sK1)
| sPE(converse(join(sK0,sK1)),converse(sK1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
( sPE(join(converse(sK0),converse(sK1)),converse(sK1))
| ~ sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals)]) ).
cnf(g4,plain,
( ~ sPE(join(sK0,sK1),sK1)
| ~ sP0 ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals)]) ).
cnf(g5,plain,
( ~ sPE(converse(sK1),join(converse(sK0),converse(sK1)))
| sPE(join(converse(sK0),converse(sK1)),converse(sK1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
sPE(converse(converse(sK1)),sK1),
inference(ground_cnf,[],[file('Axioms/REL001+0.ax',converse_idempotence)]) ).
cnf(g7,plain,
( ~ sPE(converse(join(sK0,sK1)),join(converse(sK0),converse(sK1)))
| ~ sPE(join(converse(sK0),converse(sK1)),converse(sK1))
| sPE(converse(join(sK0,sK1)),converse(sK1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g8,plain,
sPE(converse(join(sK0,sK1)),join(converse(sK0),converse(sK1))),
inference(ground_cnf,[],[file('Axioms/REL001+0.ax',converse_additivity)]) ).
cnf(g9,plain,
( ~ sPE(converse(join(sK0,sK1)),converse(sK1))
| sPE(converse(converse(join(sK0,sK1))),converse(converse(sK1))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g10,plain,
( ~ sPE(converse(join(sK0,sK1)),converse(sK1))
| sPE(converse(sK1),converse(join(sK0,sK1))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ sPE(converse(sK1),converse(join(sK0,sK1)))
| ~ sPE(converse(join(sK0,sK1)),join(converse(sK0),converse(sK1)))
| sPE(converse(sK1),join(converse(sK0),converse(sK1))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ sPE(join(sK0,sK1),converse(converse(join(sK0,sK1))))
| ~ sPE(converse(converse(join(sK0,sK1))),sK1)
| sPE(join(sK0,sK1),sK1) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g13,plain,
( ~ sPE(converse(converse(join(sK0,sK1))),join(sK0,sK1))
| sPE(join(sK0,sK1),converse(converse(join(sK0,sK1)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
sPE(converse(converse(join(sK0,sK1))),join(sK0,sK1)),
inference(ground_cnf,[],[file('Axioms/REL001+0.ax',converse_idempotence)]) ).
cnf(g15,plain,
( ~ sPE(converse(converse(join(sK0,sK1))),converse(converse(sK1)))
| ~ sPE(converse(converse(sK1)),sK1)
| sPE(converse(converse(join(sK0,sK1))),sK1) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : REL003+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : satcop --statistics %s
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jul 8 13:20:06 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 % symbols: 13
% 0.12/0.37 % clauses: 25
% 0.12/0.37 % start clauses: 2
% 0.12/0.37 % iterative deepening steps: 160
% 0.12/0.37 % maximum path limit: 4
% 0.12/0.37 % literal attempts: 24408
% 0.12/0.37 % depth failures: 14756
% 0.12/0.37 % regularity failures: 676
% 0.12/0.37 % tautology failures: 565
% 0.12/0.37 % reductions: 5692
% 0.12/0.37 % extensions: 18551
% 0.12/0.37 % SAT variables: 3611
% 0.12/0.37 % SAT clauses: 3886
% 0.12/0.37 % WalkSAT solutions: 3881
% 0.12/0.37 % CDCL solutions: 0
% 0.12/0.37 % SZS status Theorem for theBenchmark
% 0.12/0.37 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------