TSTP Solution File: GRP031-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP031-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 : n014.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:04:03 EDT 2022
% Result : Unsatisfiable 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP031-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/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 : n014.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 : Tue Jun 14 05:25:51 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S071I
% 0.13/0.37 # and selection function SelectCQArEqLast.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 7 Number of unprocessed: 7
% 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 # 7 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 4 unit axioms.
% 0.13/0.37 # 1 start rule tableaux created.
% 0.13/0.37 # 3 extension rule candidate clauses
% 0.13/0.37 # 4 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 # There were 1 total branch saturation attempts.
% 0.13/0.37 # There were 0 of these attempts blocked.
% 0.13/0.37 # There were 0 deferred branch saturation attempts.
% 0.13/0.37 # There were 0 free duplicated saturations.
% 0.13/0.37 # There were 1 total successful branch saturations.
% 0.13/0.37 # There were 0 successful branch saturations in interreduction.
% 0.13/0.37 # There were 0 successful branch saturations on the branch.
% 0.13/0.37 # There were 1 successful branch saturations after the branch.
% 0.13/0.37 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 # Begin clausification derivation
% 0.13/0.37
% 0.13/0.37 # End clausification derivation
% 0.13/0.37 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.13/0.37 cnf(i_0_12, hypothesis, (product(identity,X1,X1))).
% 0.13/0.37 cnf(i_0_13, hypothesis, (product(inverse(X1),X1,identity))).
% 0.13/0.37 cnf(i_0_8, plain, (product(X1,X2,multiply(X1,X2)))).
% 0.13/0.37 cnf(i_0_14, negated_conjecture, (~product(a,X1,identity))).
% 0.13/0.37 cnf(i_0_9, plain, (X1=X2|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 0.13/0.37 cnf(i_0_11, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))).
% 0.13/0.37 cnf(i_0_10, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))).
% 0.13/0.37 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.13/0.37 # Begin printing tableau
% 0.13/0.37 # Found 8 steps
% 0.13/0.37 cnf(i_0_14, negated_conjecture, (~product(a,identity,identity)), inference(start_rule)).
% 0.13/0.37 cnf(i_0_15, plain, (~product(a,identity,identity)), inference(extension_rule, [i_0_10])).
% 0.13/0.37 cnf(i_0_25, plain, (~product(identity,identity,identity)), inference(closure_rule, [i_0_12])).
% 0.13/0.37 cnf(i_0_26, plain, (~product(a,identity,multiply(a,identity))), inference(closure_rule, [i_0_8])).
% 0.13/0.37 cnf(i_0_24, plain, (~product(multiply(a,identity),identity,identity)), inference(extension_rule, [i_0_11])).
% 0.13/0.37 cnf(i_0_31, plain, (~product(identity,identity,identity)), inference(closure_rule, [i_0_12])).
% 0.13/0.37 cnf(i_0_32, plain, (~product(identity,identity,identity)), inference(closure_rule, [i_0_12])).
% 0.13/0.37 cnf(i_0_33, plain, (~product(identity,identity,multiply(a,identity))), inference(etableau_closure_rule, [i_0_33, ...])).
% 0.13/0.37 # End printing tableau
% 0.13/0.37 # SZS output end
% 0.13/0.37 # Branches closed with saturation will be marked with an "s"
% 0.13/0.37 # Returning from population with 2 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 2 tableaux to operate on
% 0.13/0.37 # Found closed tableau during pool population.
% 0.13/0.37 # Proof search is over...
% 0.13/0.37 # Freeing feature tree
%------------------------------------------------------------------------------