TSTP Solution File: NUM007-1 by SATCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SATCoP---0.1
% Problem : NUM007-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : satcop --statistics %s
% Computer : n025.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 13:58:11 EDT 2022
% Result : Unsatisfiable 21.41s 3.06s
% Output : Proof 21.91s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,plain,
gcd(a,b,c),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_is_gcd_of_a_and_b)]) ).
cnf(g1,plain,
~ lcm(a,b,quotient(multiply(a,b),c)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lcm)]) ).
cnf(g2,plain,
( ~ gcd(a,b,c)
| divides(c,a) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',gcd_divides2)]) ).
cnf(g3,plain,
( ~ gcd(a,b,c)
| divides(c,b) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',gcd_divides1)]) ).
cnf(g4,plain,
( ~ gcd(a,b,c)
| gcd(multiply(b,a),multiply(b,b),multiply(b,c)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_of_gcd)]) ).
cnf(g5,plain,
( ~ divides(a,quotient(multiply(a,b),c))
| ~ divides(b,quotient(multiply(a,b),c))
| divides(a,k(b,a,quotient(multiply(a,b),c)))
| lcm(a,b,quotient(multiply(a,b),c)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',lcm1)]) ).
cnf(g6,plain,
( ~ divides(a,quotient(multiply(a,b),c))
| ~ divides(b,quotient(multiply(a,b),c))
| divides(b,k(b,a,quotient(multiply(a,b),c)))
| lcm(a,b,quotient(multiply(a,b),c)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',lcm2)]) ).
cnf(g7,plain,
( ~ divides(a,quotient(multiply(a,b),c))
| ~ divides(b,quotient(multiply(a,b),c))
| ~ divides(quotient(multiply(a,b),c),k(b,a,quotient(multiply(a,b),c)))
| lcm(a,b,quotient(multiply(a,b),c)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',lcm3)]) ).
cnf(g8,plain,
( ~ divides(c,multiply(a,b))
| ~ divides(multiply(a,c),multiply(a,b))
| divides(a,quotient(multiply(a,b),c)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',divides_quotient_multiply2)]) ).
cnf(g9,plain,
( ~ divides(c,multiply(a,b))
| ~ divides(multiply(b,c),multiply(a,b))
| divides(b,quotient(multiply(a,b),c)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',divides_quotient_multiply2)]) ).
cnf(g10,plain,
( ~ divides(multiply(a,b),multiply(c,k(b,a,quotient(multiply(a,b),c))))
| ~ divides(c,multiply(a,b))
| divides(quotient(multiply(a,b),c),k(b,a,quotient(multiply(a,b),c))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',divides_quotient_multiply3)]) ).
cnf(g11,plain,
divides(a,multiply(a,b)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',operand_divides_product)]) ).
cnf(g12,plain,
( ~ divides(c,a)
| ~ divides(a,multiply(a,b))
| divides(c,multiply(a,b)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_divides)]) ).
cnf(g13,plain,
sPE(multiply(b,b),multiply(b,b)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g14,plain,
( ~ divides(c,b)
| divides(multiply(a,c),multiply(a,b)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',divides_and_multiply)]) ).
cnf(g15,plain,
sPE(multiply(b,a),multiply(a,b)),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_multiply)]) ).
cnf(g16,plain,
sPE(multiply(b,c),multiply(b,c)),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g17,plain,
( ~ sPE(multiply(b,a),multiply(a,b))
| ~ sPE(multiply(b,b),multiply(b,b))
| ~ sPE(multiply(b,c),multiply(b,c))
| ~ gcd(multiply(b,a),multiply(b,b),multiply(b,c))
| gcd(multiply(a,b),multiply(b,b),multiply(b,c)) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g18,plain,
( ~ gcd(multiply(a,b),multiply(b,b),multiply(b,c))
| divides(multiply(b,c),multiply(a,b)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',gcd_divides2)]) ).
cnf(g19,plain,
( ~ divides(a,k(b,a,quotient(multiply(a,b),c)))
| divides(multiply(b,a),multiply(b,k(b,a,quotient(multiply(a,b),c)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',divides_and_multiply)]) ).
cnf(g20,plain,
sPE(multiply(k(b,a,quotient(multiply(a,b),c)),c),multiply(c,k(b,a,quotient(multiply(a,b),c)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_multiply)]) ).
cnf(g21,plain,
sPE(multiply(b,k(b,a,quotient(multiply(a,b),c))),multiply(b,k(b,a,quotient(multiply(a,b),c)))),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g22,plain,
sPE(multiply(k(b,a,quotient(multiply(a,b),c)),b),multiply(b,k(b,a,quotient(multiply(a,b),c)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_multiply)]) ).
cnf(g23,plain,
( ~ sPE(multiply(b,a),multiply(a,b))
| ~ sPE(multiply(b,k(b,a,quotient(multiply(a,b),c))),multiply(b,k(b,a,quotient(multiply(a,b),c))))
| ~ divides(multiply(b,a),multiply(b,k(b,a,quotient(multiply(a,b),c))))
| divides(multiply(a,b),multiply(b,k(b,a,quotient(multiply(a,b),c)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
cnf(g24,plain,
sPE(multiply(k(b,a,quotient(multiply(a,b),c)),a),multiply(a,k(b,a,quotient(multiply(a,b),c)))),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_multiply)]) ).
cnf(g25,plain,
( ~ divides(b,k(b,a,quotient(multiply(a,b),c)))
| divides(multiply(a,b),multiply(a,k(b,a,quotient(multiply(a,b),c)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',divides_and_multiply)]) ).
cnf(g26,plain,
( ~ gcd(a,b,c)
| gcd(multiply(k(b,a,quotient(multiply(a,b),c)),a),multiply(k(b,a,quotient(multiply(a,b),c)),b),multiply(k(b,a,quotient(multiply(a,b),c)),c)) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_of_gcd)]) ).
cnf(g27,plain,
( ~ divides(multiply(a,b),multiply(a,k(b,a,quotient(multiply(a,b),c))))
| ~ divides(multiply(a,b),multiply(b,k(b,a,quotient(multiply(a,b),c))))
| ~ gcd(multiply(a,k(b,a,quotient(multiply(a,b),c))),multiply(b,k(b,a,quotient(multiply(a,b),c))),multiply(c,k(b,a,quotient(multiply(a,b),c))))
| divides(multiply(a,b),multiply(c,k(b,a,quotient(multiply(a,b),c)))) ),
inference(ground_cnf,[],[file('/export/starexec/sandbox/benchmark/theBenchmark.p',gcd1)]) ).
cnf(g28,plain,
( ~ sPE(multiply(k(b,a,quotient(multiply(a,b),c)),a),multiply(a,k(b,a,quotient(multiply(a,b),c))))
| ~ sPE(multiply(k(b,a,quotient(multiply(a,b),c)),b),multiply(b,k(b,a,quotient(multiply(a,b),c))))
| ~ sPE(multiply(k(b,a,quotient(multiply(a,b),c)),c),multiply(c,k(b,a,quotient(multiply(a,b),c))))
| ~ gcd(multiply(k(b,a,quotient(multiply(a,b),c)),a),multiply(k(b,a,quotient(multiply(a,b),c)),b),multiply(k(b,a,quotient(multiply(a,b),c)),c))
| gcd(multiply(a,k(b,a,quotient(multiply(a,b),c))),multiply(b,k(b,a,quotient(multiply(a,b),c))),multiply(c,k(b,a,quotient(multiply(a,b),c)))) ),
inference(ground_cnf,[],[theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM007-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : satcop --statistics %s
% 0.13/0.33 % Computer : n025.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jul 7 22:23:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 21.41/3.06 % symbols: 12
% 21.41/3.06 % clauses: 35
% 21.41/3.06 % start clauses: 2
% 21.41/3.06 % iterative deepening steps: 2195
% 21.41/3.06 % maximum path limit: 5
% 21.41/3.06 % literal attempts: 3562056
% 21.41/3.06 % depth failures: 2634144
% 21.41/3.06 % regularity failures: 107822
% 21.41/3.06 % tautology failures: 85517
% 21.41/3.06 % reductions: 337937
% 21.41/3.06 % extensions: 3223674
% 21.41/3.06 % SAT variables: 461894
% 21.41/3.06 % SAT clauses: 544867
% 21.41/3.06 % WalkSAT solutions: 544855
% 21.41/3.06 % CDCL solutions: 9
% 21.41/3.06 % SZS status Unsatisfiable for theBenchmark
% 21.41/3.06 % SZS output start ListOfCNF for theBenchmark
% See solution above
%------------------------------------------------------------------------------