TSTP Solution File: SWC046+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SWC046+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %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 : Tue Jul 19 21:53:58 EDT 2022
% Result : Theorem 48.14s 6.50s
% Output : Proof 48.59s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
ssList(sK47),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g1,plain,
ssList(sK49),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g2,plain,
ssList(sK50),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g3,plain,
sPE(nil,sK48),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g4,plain,
sPE(sK48,sK50),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g5,plain,
sPE(sK47,sK49),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g6,plain,
~ sPE(nil,sK47),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g7,plain,
( ~ ssList(sK47)
| sPE(nil,sK47)
| ssItem(sK45(sK47)) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax75)]) ).
cnf(g8,plain,
( ~ ssList(sK47)
| sPE(nil,sK47)
| ssItem(hd(sK47)) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax22)]) ).
cnf(g9,plain,
( ~ ssList(sK50)
| ~ ssList(sK47)
| sPE(sK50,sK47)
| neq(sK50,sK47) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax15)]) ).
cnf(g10,plain,
( ~ ssList(sK47)
| frontsegP(sK47,nil) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax45)]) ).
cnf(g11,plain,
( ~ ssList(sK47)
| sPE(nil,sK47)
| ssList(tl(sK47)) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax24)]) ).
cnf(g12,plain,
( ~ ssList(sK47)
| sPE(nil,sK47)
| sPE(hd(sK47),sK45(sK47)) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax75)]) ).
cnf(g13,plain,
( ~ sPE(sK50,sK49)
| ~ neq(sK50,sK49)
| ~ ssList(sK50)
| ~ ssList(sK49) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax15)]) ).
cnf(g14,plain,
( ~ ssList(sK50)
| ~ ssList(sK49)
| ~ frontsegP(sK50,sK49)
| ~ frontsegP(sK49,sK50)
| sPE(sK50,sK49) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax41)]) ).
cnf(g15,plain,
( ~ ssList(sK49)
| sPE(cons(hd(sK49),tl(sK49)),sK49)
| sPE(nil,sK49) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax78)]) ).
cnf(g16,plain,
( ~ sPE(nil,sK49)
| ~ ssList(sK49)
| frontsegP(nil,sK49) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax46)]) ).
cnf(g17,plain,
( ~ ssList(sK50)
| frontsegP(sK50,nil) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax45)]) ).
cnf(g18,plain,
( ~ ssList(sK50)
| ~ ssList(sK50)
| ~ rearsegP(sK50,sK50)
| ~ rearsegP(sK50,sK50)
| sPE(sK50,sK50) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax48)]) ).
cnf(g19,plain,
( ~ ssList(sK50)
| rearsegP(sK50,sK50) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax49)]) ).
cnf(g20,plain,
( ~ sPE(nil,sK50)
| ~ ssList(sK50)
| frontsegP(nil,sK50) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax46)]) ).
cnf(g21,plain,
( ~ sPE(nil,sK48)
| ~ sPE(sK48,sK50)
| sPE(nil,sK50) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g22,plain,
( ~ sPE(sK47,sK49)
| sPE(tl(sK47),tl(sK49)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g23,plain,
( ~ sPE(sK47,sK49)
| ~ sPE(sK50,sK50)
| ~ frontsegP(sK47,sK50)
| frontsegP(sK49,sK50) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g24,plain,
( ~ sPE(sK50,sK50)
| ~ sPE(sK47,sK49)
| ~ neq(sK50,sK47)
| neq(sK50,sK49) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g25,plain,
( ~ sPE(sK47,sK49)
| sPE(hd(sK47),hd(sK49)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g26,plain,
( ~ sPE(nil,sK50)
| ~ sPE(sK50,sK47)
| sPE(nil,sK47) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g27,plain,
ssList(nil),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax17)]) ).
cnf(g28,plain,
( ~ sPE(nil,sK50)
| sPE(sK50,nil) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g29,plain,
( ~ ssList(sK47)
| ~ ssList(nil)
| ~ ssList(sK50)
| ~ frontsegP(sK47,nil)
| ~ frontsegP(nil,sK50)
| frontsegP(sK47,sK50) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax40)]) ).
cnf(g30,plain,
( ~ sPE(tl(sK47),tl(sK49))
| ~ ssList(tl(sK47))
| ssList(tl(sK49)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g31,plain,
( ~ sPE(hd(sK47),hd(sK49))
| ~ ssItem(hd(sK47))
| ssItem(hd(sK49)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g32,plain,
( ~ ssItem(sK45(sK47))
| ~ memberP(nil,sK45(sK47)) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax38)]) ).
cnf(g33,plain,
( ~ ssItem(hd(sK47))
| ~ memberP(sK49,hd(sK47))
| memberP(sK50,hd(sK47)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1)]) ).
cnf(g34,plain,
( ~ ssList(sK50)
| ~ ssList(nil)
| ~ ssList(sK49)
| ~ frontsegP(sK50,nil)
| ~ frontsegP(nil,sK49)
| frontsegP(sK50,sK49) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax40)]) ).
cnf(g35,plain,
sPE(hd(sK47),hd(sK47)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g36,plain,
( ~ sPE(cons(hd(sK49),tl(sK49)),sK49)
| ~ sPE(hd(sK47),hd(sK47))
| ~ memberP(cons(hd(sK49),tl(sK49)),hd(sK47))
| memberP(sK49,hd(sK47)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g37,plain,
( ~ sPE(hd(sK47),hd(sK49))
| ~ ssItem(hd(sK47))
| ~ ssItem(hd(sK49))
| ~ ssList(tl(sK49))
| memberP(cons(hd(sK49),tl(sK49)),hd(sK47)) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax37)]) ).
cnf(g38,plain,
( ~ sPE(sK50,nil)
| ~ sPE(hd(sK47),sK45(sK47))
| ~ memberP(sK50,hd(sK47))
| memberP(nil,sK45(sK47)) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC046+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12 % Command : satcop --statistics %s
% 0.12/0.33 % Computer : n020.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 : Sun Jun 12 00:43:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 48.14/6.49 % symbols: 78
% 48.14/6.49 % clauses: 272
% 48.14/6.49 % start clauses: 12
% 48.14/6.49 % iterative deepening steps: 638
% 48.14/6.49 % maximum path limit: 2
% 48.14/6.49 % literal attempts: 33682721
% 48.14/6.49 % depth failures: 32548970
% 48.14/6.49 % regularity failures: 95622
% 48.14/6.49 % tautology failures: 264504
% 48.14/6.49 % reductions: 126419
% 48.14/6.49 % extensions: 33549006
% 48.14/6.49 % SAT variables: 622186
% 48.14/6.49 % SAT clauses: 704683
% 48.14/6.50 % WalkSAT solutions: 704674
% 48.14/6.50 % CDCL solutions: 8
% 48.14/6.50 % SZS status Theorem for theBenchmark
% 48.14/6.50 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------