%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : CSR021+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n027.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 : Fri Jul 15 23:15:00 EDT 2022
% Result : Theorem 0.20s 0.54s
% Output : Proof 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
holdsAt(backwards,n3),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_backwards_3)]) ).
cnf(g1,plain,
sPE(backwards,backwards),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g2,plain,
( ~ sPE(plus(n1,n2),n3)
| sPE(n3,plus(n1,n2)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g3,plain,
sPE(plus(n1,n2),n3),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1_2)]) ).
cnf(g4,plain,
sPE(plus(n1,n2),plus(n2,n1)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_plus)]) ).
cnf(g5,plain,
sPE(push,push),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g6,plain,
sPE(pull,pull),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g7,plain,
( ~ sPE(pull,pull)
| ~ sPE(n2,n2)
| happens(pull,n2) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',happens_all_defn)]) ).
cnf(g8,plain,
sPE(n2,n2),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g9,plain,
( ~ happens(pull,n2)
| ~ terminates(pull,backwards,n2)
| ~ holdsAt(backwards,plus(n2,n1)) ),
inference(ground_cnf,[],[file('Axioms/CSR001+0.ax',happens_terminates_not_holds)]) ).
cnf(g10,plain,
( ~ sPE(n3,plus(n1,n2))
| ~ sPE(plus(n1,n2),plus(n2,n1))
| sPE(n3,plus(n2,n1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g11,plain,
( ~ sPE(backwards,backwards)
| ~ sPE(n3,plus(n2,n1))
| ~ holdsAt(backwards,n3)
| holdsAt(backwards,plus(n2,n1)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g12,plain,
( ~ sPE(pull,pull)
| ~ sPE(backwards,backwards)
| ~ happens(push,n2)
| terminates(pull,backwards,n2) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',terminates_all_defn)]) ).
cnf(g13,plain,
( ~ sPE(push,push)
| ~ sPE(n2,n2)
| happens(push,n2) ),
inference(ground_cnf,[],[file('Axioms/CSR001+2.ax',happens_all_defn)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : CSR021+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.10/0.12 % Command : satcop --statistics %s
% 0.13/0.34 % Computer : n027.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 : Fri Jun 10 10:38:28 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.54 % symbols: 48
% 0.20/0.54 % clauses: 153
% 0.20/0.54 % start clauses: 1
% 0.20/0.54 % iterative deepening steps: 492
% 0.20/0.54 % maximum path limit: 5
% 0.20/0.54 % literal attempts: 303610
% 0.20/0.54 % depth failures: 241165
% 0.20/0.54 % regularity failures: 15307
% 0.20/0.54 % tautology failures: 6224
% 0.20/0.54 % reductions: 1148
% 0.20/0.54 % extensions: 302250
% 0.20/0.54 % SAT variables: 30293
% 0.20/0.54 % SAT clauses: 39609
% 0.20/0.54 % WalkSAT solutions: 39607
% 0.20/0.54 % CDCL solutions: 0
% 0.20/0.54 % SZS status Theorem for theBenchmark
% 0.20/0.54 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------