TSTP Solution File: GRP013-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : GRP013-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 : n022.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:03:56 EDT 2022
% Result : Unsatisfiable 0.15s 0.39s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : GRP013-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/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 : n022.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 : Mon Jun 13 11:19:18 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.15/0.39 # No SInE strategy applied
% 0.15/0.39 # Auto-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_PS_S0S
% 0.15/0.39 # and selection function SelectComplexG.
% 0.15/0.39 #
% 0.15/0.39 # Presaturation interreduction done
% 0.15/0.39 # Number of axioms: 13 Number of unprocessed: 13
% 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 # 13 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 9 unit axioms.
% 0.15/0.39 # 1 start rule tableaux created.
% 0.15/0.39 # 4 extension rule candidate clauses
% 0.15/0.39 # 9 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 # There were 1 total branch saturation attempts.
% 0.15/0.39 # There were 0 of these attempts blocked.
% 0.15/0.39 # There were 0 deferred branch saturation attempts.
% 0.15/0.39 # There were 0 free duplicated saturations.
% 0.15/0.39 # There were 1 total successful branch saturations.
% 0.15/0.39 # There were 0 successful branch saturations in interreduction.
% 0.15/0.39 # There were 0 successful branch saturations on the branch.
% 0.15/0.39 # There were 1 successful branch saturations after the branch.
% 0.15/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.39 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.39 # Begin clausification derivation
% 0.15/0.39
% 0.15/0.39 # End clausification derivation
% 0.15/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.15/0.39 cnf(i_0_23, hypothesis, (product(a,b,c))).
% 0.15/0.39 cnf(i_0_22, hypothesis, (product(X1,X1,identity))).
% 0.15/0.39 cnf(i_0_15, plain, (product(X1,identity,X1))).
% 0.15/0.39 cnf(i_0_14, plain, (product(identity,X1,X1))).
% 0.15/0.39 cnf(i_0_17, plain, (product(X1,inverse(X1),identity))).
% 0.15/0.39 cnf(i_0_16, plain, (product(inverse(X1),X1,identity))).
% 0.15/0.39 cnf(i_0_24, hypothesis, (product(inverse(a),inverse(b),d))).
% 0.15/0.39 cnf(i_0_18, plain, (product(X1,X2,multiply(X1,X2)))).
% 0.15/0.39 cnf(i_0_26, negated_conjecture, (~product(c,d,identity))).
% 0.15/0.39 cnf(i_0_25, hypothesis, (product(X1,X2,X3)|~product(inverse(X1),inverse(X3),X2))).
% 0.15/0.39 cnf(i_0_19, plain, (X1=X2|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 0.15/0.39 cnf(i_0_21, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))).
% 0.15/0.39 cnf(i_0_20, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))).
% 0.15/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.15/0.39 # Begin printing tableau
% 0.15/0.39 # Found 6 steps
% 0.15/0.39 cnf(i_0_26, negated_conjecture, (~product(c,d,identity)), inference(start_rule)).
% 0.15/0.39 cnf(i_0_27, plain, (~product(c,d,identity)), inference(extension_rule, [i_0_20])).
% 0.15/0.39 cnf(i_0_38, plain, (~product(identity,identity,identity)), inference(closure_rule, [i_0_22])).
% 0.15/0.39 cnf(i_0_40, plain, (~product(c,c,identity)), inference(closure_rule, [i_0_22])).
% 0.15/0.39 cnf(i_0_39, plain, (~product(c,identity,d)), inference(extension_rule, [i_0_25])).
% 0.15/0.39 cnf(i_0_42, plain, (~product(inverse(c),inverse(d),identity)), inference(etableau_closure_rule, [i_0_42, ...])).
% 0.15/0.39 # End printing tableau
% 0.15/0.39 # SZS output end
% 0.15/0.39 # Branches closed with saturation will be marked with an "s"
% 0.15/0.39 # Returning from population with 3 new_tableaux and 0 remaining starting tableaux.
% 0.15/0.39 # We now have 3 tableaux to operate on
% 0.15/0.39 # Found closed tableau during pool population.
% 0.15/0.39 # Proof search is over...
% 0.15/0.39 # Freeing feature tree
%------------------------------------------------------------------------------