TSTP Solution File: GRP701-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP701-1 : TPTP v8.1.0. Released v4.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 : n023.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:08:04 EDT 2022
% Result : Unsatisfiable 8.65s 1.50s
% Output : CNFRefutation 8.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP701-1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n023.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 : Mon Jun 13 19:47:51 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic H_____047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 0.13/0.37 # and selection function SelectNewComplexAHP.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 11 Number of unprocessed: 11
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 11 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 1 conjectures.
% 0.13/0.37 # There are 1 start rule candidates:
% 0.13/0.37 # Found 11 unit axioms.
% 0.13/0.37 # 1 start rule tableaux created.
% 0.13/0.37 # 0 extension rule candidate clauses
% 0.13/0.37 # 11 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.13/0.37 # There are not enough tableaux to fork, creating more from the initial 1
% 0.13/0.37 # Creating equality axioms
% 0.13/0.37 # Ran out of tableaux, making start rules for all clauses
% 0.13/0.37 # Returning from population with 19 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 19 tableaux to operate on
% 8.65/1.50 # There were 1 total branch saturation attempts.
% 8.65/1.50 # There were 0 of these attempts blocked.
% 8.65/1.50 # There were 0 deferred branch saturation attempts.
% 8.65/1.50 # There were 0 free duplicated saturations.
% 8.65/1.50 # There were 1 total successful branch saturations.
% 8.65/1.50 # There were 0 successful branch saturations in interreduction.
% 8.65/1.50 # There were 0 successful branch saturations on the branch.
% 8.65/1.50 # There were 1 successful branch saturations after the branch.
% 8.65/1.50 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.65/1.50 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.65/1.50 # Begin clausification derivation
% 8.65/1.50
% 8.65/1.50 # End clausification derivation
% 8.65/1.50 # Begin listing active clauses obtained from FOF to CNF conversion
% 8.65/1.50 cnf(i_0_16, plain, (mult(X1,unit)=X1)).
% 8.65/1.50 cnf(i_0_17, plain, (mult(unit,X1)=X1)).
% 8.65/1.50 cnf(i_0_20, plain, (mult(X1,i(X1))=unit)).
% 8.65/1.50 cnf(i_0_21, plain, (mult(i(X1),X1)=unit)).
% 8.65/1.50 cnf(i_0_13, plain, (ld(X1,mult(X1,X2))=X2)).
% 8.65/1.50 cnf(i_0_12, plain, (mult(X1,ld(X1,X2))=X2)).
% 8.65/1.50 cnf(i_0_14, plain, (mult(rd(X1,X2),X2)=X1)).
% 8.65/1.50 cnf(i_0_15, plain, (rd(mult(X1,X2),X2)=X1)).
% 8.65/1.50 cnf(i_0_19, plain, (mult(mult(X1,mult(X2,mult(X2,X3))),X2)=mult(mult(X1,X2),mult(X2,mult(X3,X2))))).
% 8.65/1.50 cnf(i_0_18, plain, (mult(mult(mult(X1,X2),X1),mult(X1,X3))=mult(X1,mult(mult(mult(X2,X1),X1),X3)))).
% 8.65/1.50 cnf(i_0_22, negated_conjecture, (mult(a,i(mult(b,a)))!=i(b))).
% 8.65/1.50 cnf(i_0_24, plain, (X4=X4)).
% 8.65/1.50 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 8.65/1.50 # Begin printing tableau
% 8.65/1.50 # Found 5 steps
% 8.65/1.50 cnf(i_0_16, plain, (mult(X3,unit)=X3), inference(start_rule)).
% 8.65/1.50 cnf(i_0_32, plain, (mult(X3,unit)=X3), inference(extension_rule, [i_0_31])).
% 8.65/1.50 cnf(i_0_60, plain, (i(mult(X3,unit))=i(X3)), inference(extension_rule, [i_0_27])).
% 8.65/1.50 cnf(i_0_68, plain, (i(X3)!=mult(i(X3),unit)), inference(closure_rule, [i_0_16])).
% 8.65/1.50 cnf(i_0_66, plain, (i(mult(X3,unit))=mult(i(X3),unit)), inference(etableau_closure_rule, [i_0_66, ...])).
% 8.65/1.50 # End printing tableau
% 8.65/1.50 # SZS output end
% 8.65/1.50 # Branches closed with saturation will be marked with an "s"
% 8.65/1.50 # Child (16326) has found a proof.
% 8.65/1.50
% 8.65/1.50 # Proof search is over...
% 8.65/1.50 # Freeing feature tree
%------------------------------------------------------------------------------