TSTP Solution File: SWC385+1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : SWC385+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n008.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:56:02 EDT 2022
% Result : Theorem 0.13s 0.50s
% Output : Proof 0.13s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
ssList(sK48),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g1,plain,
ssList(sK49),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g2,plain,
ssList(sK50),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g3,plain,
sPE(sK48,sK50),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g4,plain,
sPE(sK47,sK49),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g5,plain,
neq(sK48,nil),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g6,plain,
segmentP(sK50,sK49),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g7,plain,
( ~ neq(sK50,nil)
| singletonP(sK49) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g8,plain,
( ~ singletonP(sK47)
| ~ segmentP(sK48,sK47) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1)]) ).
cnf(g9,plain,
( ~ ssList(sK48)
| segmentP(sK48,sK48) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax55)]) ).
cnf(g10,plain,
( ~ sPE(sK48,sK48)
| ~ sPE(sK48,sK50)
| ~ segmentP(sK48,sK48)
| segmentP(sK48,sK50) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ sPE(sK47,sK49)
| sPE(sK49,sK47) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ ssList(sK48)
| ~ ssList(sK50)
| ~ ssList(sK49)
| ~ segmentP(sK48,sK50)
| ~ segmentP(sK50,sK49)
| segmentP(sK48,sK49) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax53)]) ).
cnf(g13,plain,
ssItem(sK0),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax2)]) ).
cnf(g14,plain,
( ~ ssItem(sK0)
| ~ ssList(sK48)
| sPE(tl(cons(sK0,sK48)),sK48) ),
inference(ground_cnf,[],[file('Axioms/SWC001+0.ax',ax25)]) ).
cnf(g15,plain,
( ~ sPE(tl(cons(sK0,sK48)),sK48)
| sPE(sK48,tl(cons(sK0,sK48))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g16,plain,
( ~ sPE(sK48,tl(cons(sK0,sK48)))
| ~ sPE(tl(cons(sK0,sK48)),sK48)
| sPE(sK48,sK48) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
sPE(nil,nil),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ sPE(sK48,sK50)
| ~ sPE(nil,nil)
| ~ neq(sK48,nil)
| neq(sK50,nil) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g19,plain,
( ~ sPE(sK49,sK47)
| ~ singletonP(sK49)
| singletonP(sK47) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g20,plain,
( ~ sPE(sK48,sK48)
| ~ sPE(sK49,sK47)
| ~ segmentP(sK48,sK49)
| segmentP(sK48,sK47) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08 % Problem : SWC385+1 : TPTP v8.1.0. Released v2.4.0.
% 0.02/0.09 % Command : satcop --statistics %s
% 0.08/0.28 % Computer : n008.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 600
% 0.08/0.28 % DateTime : Sun Jun 12 14:25:22 EDT 2022
% 0.08/0.28 % CPUTime :
% 0.13/0.49 % symbols: 77
% 0.13/0.50 % clauses: 269
% 0.13/0.50 % start clauses: 10
% 0.13/0.50 % iterative deepening steps: 27
% 0.13/0.50 % maximum path limit: 1
% 0.13/0.50 % literal attempts: 134695
% 0.13/0.50 % depth failures: 130704
% 0.13/0.50 % regularity failures: 101
% 0.13/0.50 % tautology failures: 978
% 0.13/0.50 % reductions: 504
% 0.13/0.50 % extensions: 134015
% 0.13/0.50 % SAT variables: 100201
% 0.13/0.50 % SAT clauses: 96507
% 0.13/0.50 % WalkSAT solutions: 96499
% 0.13/0.50 % CDCL solutions: 6
% 0.13/0.50 % SZS status Theorem for theBenchmark
% 0.13/0.50 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------