TSTP Solution File: GRP203-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP203-1 : TPTP v8.1.0. Released v2.2.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 : n019.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 : Sat Jul 16 09:05:26 EDT 2022
% Result : Unsatisfiable 6.31s 1.18s
% Output : CNFRefutation 6.31s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : GRP203-1 : TPTP v8.1.0. Released v2.2.0.
% 0.08/0.15 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.15/0.36 % Computer : n019.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Tue Jun 14 11:35:24 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.15/0.39 # No SInE strategy applied
% 0.15/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S04AN
% 0.15/0.39 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.15/0.39 #
% 0.15/0.39 # Presaturation interreduction done
% 0.15/0.39 # Number of axioms: 4 Number of unprocessed: 4
% 0.15/0.39 # Tableaux proof search.
% 0.15/0.39 # APR header successfully linked.
% 0.15/0.39 # Hello from C++
% 0.15/0.39 # The folding up rule is enabled...
% 0.15/0.39 # Local unification is enabled...
% 0.15/0.39 # Any saturation attempts will use folding labels...
% 0.15/0.39 # 4 beginning clauses after preprocessing and clausification
% 0.15/0.39 # Creating start rules for all 1 conjectures.
% 0.15/0.39 # There are 1 start rule candidates:
% 0.15/0.39 # Found 4 unit axioms.
% 0.15/0.39 # 1 start rule tableaux created.
% 0.15/0.39 # 0 extension rule candidate clauses
% 0.15/0.39 # 4 unit axiom clauses
% 0.15/0.39
% 0.15/0.39 # Requested 8, 32 cores available to the main process.
% 0.15/0.39 # There are not enough tableaux to fork, creating more from the initial 1
% 0.15/0.39 # Creating equality axioms
% 0.15/0.39 # Ran out of tableaux, making start rules for all clauses
% 0.15/0.39 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.15/0.39 # We now have 8 tableaux to operate on
% 6.31/1.18 # There were 1 total branch saturation attempts.
% 6.31/1.18 # There were 0 of these attempts blocked.
% 6.31/1.18 # There were 0 deferred branch saturation attempts.
% 6.31/1.18 # There were 0 free duplicated saturations.
% 6.31/1.18 # There were 1 total successful branch saturations.
% 6.31/1.18 # There were 0 successful branch saturations in interreduction.
% 6.31/1.18 # There were 0 successful branch saturations on the branch.
% 6.31/1.18 # There were 1 successful branch saturations after the branch.
% 6.31/1.18 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.31/1.18 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.31/1.18 # Begin clausification derivation
% 6.31/1.18
% 6.31/1.18 # End clausification derivation
% 6.31/1.18 # Begin listing active clauses obtained from FOF to CNF conversion
% 6.31/1.18 cnf(i_0_5, plain, (multiply(identity,X1)=X1)).
% 6.31/1.18 cnf(i_0_6, plain, (multiply(left_inverse(X1),X1)=identity)).
% 6.31/1.18 cnf(i_0_7, plain, (multiply(multiply(multiply(X1,X2),X1),X3)=multiply(X1,multiply(X2,multiply(X1,X3))))).
% 6.31/1.18 cnf(i_0_8, negated_conjecture, (multiply(multiply(multiply(a,b),c),b)!=multiply(a,multiply(b,multiply(c,b))))).
% 6.31/1.18 cnf(i_0_10, plain, (X4=X4)).
% 6.31/1.18 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 6.31/1.18 # Begin printing tableau
% 6.31/1.18 # Found 6 steps
% 6.31/1.18 cnf(i_0_7, plain, (multiply(multiply(multiply(X11,X2),X11),X3)=multiply(X11,multiply(X2,multiply(X11,X3)))), inference(start_rule)).
% 6.31/1.18 cnf(i_0_18, plain, (multiply(multiply(multiply(X11,X2),X11),X3)=multiply(X11,multiply(X2,multiply(X11,X3)))), inference(extension_rule, [i_0_13])).
% 6.31/1.18 cnf(i_0_39, plain, (multiply(multiply(multiply(X11,X2),X11),X3)!=multiply(X11,multiply(X2,multiply(X11,X3)))), inference(closure_rule, [i_0_7])).
% 6.31/1.18 cnf(i_0_37, plain, (multiply(multiply(multiply(X11,X2),X11),X3)=multiply(multiply(multiply(X11,X2),X11),X3)), inference(extension_rule, [i_0_14])).
% 6.31/1.18 cnf(i_0_46, plain, (multiply(identity,X11)!=X11), inference(closure_rule, [i_0_5])).
% 6.31/1.18 cnf(i_0_44, plain, (multiply(multiply(multiply(multiply(X11,X2),X11),X3),multiply(identity,X11))=multiply(multiply(multiply(multiply(X11,X2),X11),X3),X11)), inference(etableau_closure_rule, [i_0_44, ...])).
% 6.31/1.18 # End printing tableau
% 6.31/1.18 # SZS output end
% 6.31/1.18 # Branches closed with saturation will be marked with an "s"
% 6.31/1.18 # Child (27320) has found a proof.
% 6.31/1.18
% 6.31/1.18 # Proof search is over...
% 6.31/1.18 # Freeing feature tree
%------------------------------------------------------------------------------