TSTP Solution File: SWC294+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SWC294+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n011.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 : Tue Jul 19 21:55:29 EDT 2022
% Result : Theorem 0.19s 0.55s
% Output : Proof 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
ssList(sK49),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g1,plain,
ssList(sK50),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g2,plain,
sPE(sK47,sK49),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g3,plain,
segmentP(sK50,sK49),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g4,plain,
~ strictorderedP(sK47),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g5,plain,
( ~ neq(sK50,nil)
| singletonP(sK49) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g6,plain,
( ~ ssList(sK49)
| ~ segmentP(nil,sK49)
| sPE(nil,sK49) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax58)]) ).
cnf(g7,plain,
( ~ ssList(sK49)
| ~ singletonP(sK49)
| sPE(cons(sK4(sK49),nil),sK49) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax4)]) ).
cnf(g8,plain,
( ~ ssList(sK49)
| ~ singletonP(sK49)
| ssItem(sK4(sK49)) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax4)]) ).
cnf(g9,plain,
( ~ sPE(nil,sK50)
| ~ ssList(sK50)
| segmentP(nil,sK50) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax58)]) ).
cnf(g10,plain,
( ~ sPE(sK47,sK49)
| sPE(sK49,sK47) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ sPE(sK49,sK47)
| ~ strictorderedP(sK49)
| strictorderedP(sK47) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ ssList(sK50)
| ~ ssList(nil)
| sPE(sK50,nil)
| neq(sK50,nil) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax15)]) ).
cnf(g13,plain,
ssList(nil),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax17)]) ).
cnf(g14,plain,
( ~ sPE(sK50,nil)
| sPE(nil,sK50) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g15,plain,
( ~ sPE(nil,sK49)
| ~ sPE(sK49,sK47)
| sPE(nil,sK47) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ ssList(nil)
| ~ ssList(sK50)
| ~ ssList(sK49)
| ~ segmentP(nil,sK50)
| ~ segmentP(sK50,sK49)
| segmentP(nil,sK49) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax53)]) ).
cnf(g17,plain,
( ~ sPE(nil,sK47)
| ~ strictorderedP(nil)
| strictorderedP(sK47) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
strictorderedP(nil),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax69)]) ).
cnf(g19,plain,
( ~ ssItem(sK4(sK49))
| strictorderedP(cons(sK4(sK49),nil)) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax68)]) ).
cnf(g20,plain,
( ~ sPE(cons(sK4(sK49),nil),sK49)
| ~ strictorderedP(cons(sK4(sK49),nil))
| strictorderedP(sK49) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC294+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n011.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 : Sat Jun 11 22:50:17 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.55 % symbols: 77
% 0.19/0.55 % clauses: 268
% 0.19/0.55 % start clauses: 9
% 0.19/0.55 % iterative deepening steps: 25
% 0.19/0.55 % maximum path limit: 2
% 0.19/0.55 % literal attempts: 99628
% 0.19/0.55 % depth failures: 96590
% 0.19/0.55 % regularity failures: 91
% 0.19/0.55 % tautology failures: 818
% 0.19/0.55 % reductions: 592
% 0.19/0.55 % extensions: 98900
% 0.19/0.55 % SAT variables: 78469
% 0.19/0.55 % SAT clauses: 76041
% 0.19/0.55 % WalkSAT solutions: 76034
% 0.19/0.55 % CDCL solutions: 4
% 0.19/0.55 % SZS status Theorem for theBenchmark
% 0.19/0.55 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------