TSTP Solution File: NUM007-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUM007-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n004.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 09:38:18 EDT 2022
% Result : Unsatisfiable 0.18s 0.48s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : NUM007-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n004.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 : Thu Jul 7 22:11:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 # No SInE strategy applied
% 0.12/0.36 # Auto-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI
% 0.12/0.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.12/0.36 #
% 0.12/0.36 # Presaturation interreduction done
% 0.12/0.36 # Number of axioms: 25 Number of unprocessed: 25
% 0.12/0.36 # Tableaux proof search.
% 0.12/0.36 # APR header successfully linked.
% 0.12/0.36 # Hello from C++
% 0.12/0.36 # The folding up rule is enabled...
% 0.12/0.36 # Local unification is enabled...
% 0.12/0.36 # Any saturation attempts will use folding labels...
% 0.12/0.36 # 25 beginning clauses after preprocessing and clausification
% 0.12/0.36 # Creating start rules for all 2 conjectures.
% 0.12/0.36 # There are 2 start rule candidates:
% 0.12/0.36 # Found 8 unit axioms.
% 0.12/0.36 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36 # 2 start rule tableaux created.
% 0.12/0.36 # 17 extension rule candidate clauses
% 0.12/0.36 # 8 unit axiom clauses
% 0.12/0.36
% 0.12/0.36 # Requested 8, 32 cores available to the main process.
% 0.12/0.36 # There are not enough tableaux to fork, creating more from the initial 2
% 0.12/0.36 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36 # We now have 9 tableaux to operate on
% 0.18/0.48 # There were 1 total branch saturation attempts.
% 0.18/0.48 # There were 0 of these attempts blocked.
% 0.18/0.48 # There were 0 deferred branch saturation attempts.
% 0.18/0.48 # There were 0 free duplicated saturations.
% 0.18/0.48 # There were 1 total successful branch saturations.
% 0.18/0.48 # There were 0 successful branch saturations in interreduction.
% 0.18/0.48 # There were 0 successful branch saturations on the branch.
% 0.18/0.48 # There were 1 successful branch saturations after the branch.
% 0.18/0.48 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.48 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.48 # Begin clausification derivation
% 0.18/0.48
% 0.18/0.48 # End clausification derivation
% 0.18/0.48 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.48 cnf(i_0_49, negated_conjecture, (gcd(a,b,c))).
% 0.18/0.48 cnf(i_0_26, plain, (divides(X1,X1))).
% 0.18/0.48 cnf(i_0_28, plain, (divides(X1,multiply(X1,X2)))).
% 0.18/0.48 cnf(i_0_30, plain, (divides(quotient(X1,X1),X2))).
% 0.18/0.48 cnf(i_0_46, plain, (multiply(X1,X2)=multiply(X2,X1))).
% 0.18/0.48 cnf(i_0_45, plain, (h(X1,X2,X3)=h(X2,X1,X3))).
% 0.18/0.48 cnf(i_0_44, plain, (k(X1,X2,X3)=k(X2,X1,X3))).
% 0.18/0.48 cnf(i_0_50, negated_conjecture, (~lcm(a,b,quotient(multiply(a,b),c)))).
% 0.18/0.48 cnf(i_0_34, plain, (divides(X1,X2)|~gcd(X3,X2,X1))).
% 0.18/0.48 cnf(i_0_35, plain, (divides(X1,X2)|~gcd(X2,X3,X1))).
% 0.18/0.48 cnf(i_0_48, plain, (gcd(X1,X2,X3)|~gcd(X2,X1,X3))).
% 0.18/0.48 cnf(i_0_27, plain, (divides(X1,X2)|~divides(X3,X2)|~divides(X1,X3))).
% 0.18/0.48 cnf(i_0_47, plain, (lcm(X1,X2,X3)|~lcm(X2,X1,X3))).
% 0.18/0.48 cnf(i_0_40, plain, (gcd(multiply(X1,X2),multiply(X1,X3),multiply(X1,X4))|~gcd(X2,X3,X4))).
% 0.18/0.48 cnf(i_0_29, plain, (divides(multiply(X1,X2),multiply(X1,X3))|~divides(X2,X3))).
% 0.18/0.48 cnf(i_0_36, plain, (divides(X1,X2)|~gcd(X3,X4,X2)|~divides(X1,X4)|~divides(X1,X3))).
% 0.18/0.48 cnf(i_0_31, plain, (divides(X1,multiply(X2,X3))|~divides(quotient(X1,X2),X3)|~divides(X2,X1))).
% 0.18/0.48 cnf(i_0_32, plain, (divides(X1,quotient(X2,X3))|~divides(multiply(X1,X3),X2)|~divides(X3,X2))).
% 0.18/0.48 cnf(i_0_33, plain, (divides(quotient(X1,X2),X3)|~divides(X1,multiply(X2,X3))|~divides(X2,X1))).
% 0.18/0.48 cnf(i_0_42, plain, (lcm(X1,X2,X3)|divides(X2,k(X2,X1,X3))|~divides(X2,X3)|~divides(X1,X3))).
% 0.18/0.48 cnf(i_0_41, plain, (lcm(X1,X2,X3)|divides(X1,k(X2,X1,X3))|~divides(X2,X3)|~divides(X1,X3))).
% 0.18/0.48 cnf(i_0_38, plain, (gcd(X1,X2,X3)|divides(h(X2,X1,X3),X2)|~divides(X3,X2)|~divides(X3,X1))).
% 0.18/0.48 cnf(i_0_37, plain, (gcd(X1,X2,X3)|divides(h(X2,X1,X3),X1)|~divides(X3,X2)|~divides(X3,X1))).
% 0.18/0.48 cnf(i_0_43, plain, (lcm(X1,X2,X3)|~divides(X3,k(X2,X1,X3))|~divides(X2,X3)|~divides(X1,X3))).
% 0.18/0.48 cnf(i_0_39, plain, (gcd(X1,X2,X3)|~divides(h(X2,X1,X3),X3)|~divides(X3,X2)|~divides(X3,X1))).
% 0.18/0.48 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.18/0.48 # Begin printing tableau
% 0.18/0.48 # Found 4 steps
% 0.18/0.48 cnf(i_0_49, negated_conjecture, (gcd(a,b,c)), inference(start_rule)).
% 0.18/0.48 cnf(i_0_52, plain, (gcd(a,b,c)), inference(extension_rule, [i_0_40])).
% 0.18/0.48 cnf(i_0_116, plain, (gcd(multiply(X8,a),multiply(X8,b),multiply(X8,c))), inference(extension_rule, [i_0_34])).
% 0.18/0.48 cnf(i_0_157, plain, (divides(multiply(X8,c),multiply(X8,b))), inference(etableau_closure_rule, [i_0_157, ...])).
% 0.18/0.48 # End printing tableau
% 0.18/0.48 # SZS output end
% 0.18/0.48 # Branches closed with saturation will be marked with an "s"
% 0.18/0.48 # Child (11757) has found a proof.
% 0.18/0.48
% 0.18/0.48 # Proof search is over...
% 0.18/0.48 # Freeing feature tree
%------------------------------------------------------------------------------