TSTP Solution File: FLD031-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : FLD031-1 : TPTP v8.1.0. Bugfixed v2.1.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 : n025.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 02:06:05 EDT 2022
% Result : Unsatisfiable 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : FLD031-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.06/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 : n025.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 : Mon Jun 6 18:27:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 # No SInE strategy applied
% 0.12/0.34 # Auto-Mode selected heuristic G_E___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 0.12/0.34 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.12/0.34 #
% 0.12/0.34 # Presaturation interreduction done
% 0.12/0.34 # Number of axioms: 31 Number of unprocessed: 31
% 0.12/0.34 # Tableaux proof search.
% 0.12/0.34 # APR header successfully linked.
% 0.12/0.34 # Hello from C++
% 0.12/0.34 # The folding up rule is enabled...
% 0.12/0.34 # Local unification is enabled...
% 0.12/0.34 # Any saturation attempts will use folding labels...
% 0.12/0.34 # 31 beginning clauses after preprocessing and clausification
% 0.12/0.34 # Creating start rules for all 3 conjectures.
% 0.12/0.34 # There are 3 start rule candidates:
% 0.12/0.34 # Found 7 unit axioms.
% 0.12/0.34 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.34 # 3 start rule tableaux created.
% 0.12/0.34 # 24 extension rule candidate clauses
% 0.12/0.34 # 7 unit axiom clauses
% 0.12/0.34
% 0.12/0.34 # Requested 8, 32 cores available to the main process.
% 0.12/0.34 # There are not enough tableaux to fork, creating more from the initial 3
% 0.12/0.34 # Returning from population with 9 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.34 # We now have 9 tableaux to operate on
% 0.17/0.46 # There were 1 total branch saturation attempts.
% 0.17/0.46 # There were 0 of these attempts blocked.
% 0.17/0.46 # There were 0 deferred branch saturation attempts.
% 0.17/0.46 # There were 0 free duplicated saturations.
% 0.17/0.46 # There were 1 total successful branch saturations.
% 0.17/0.46 # There were 0 successful branch saturations in interreduction.
% 0.17/0.46 # There were 0 successful branch saturations on the branch.
% 0.17/0.46 # There were 1 successful branch saturations after the branch.
% 0.17/0.46 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.46 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.46 # Begin clausification derivation
% 0.17/0.46
% 0.17/0.46 # End clausification derivation
% 0.17/0.46 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.17/0.46 cnf(i_0_42, plain, (defined(additive_identity))).
% 0.17/0.46 cnf(i_0_60, negated_conjecture, (equalish(a,multiplicative_identity))).
% 0.17/0.46 cnf(i_0_45, plain, (defined(multiplicative_identity))).
% 0.17/0.46 cnf(i_0_59, hypothesis, (defined(a))).
% 0.17/0.46 cnf(i_0_58, plain, (~equalish(additive_identity,multiplicative_identity))).
% 0.17/0.46 cnf(i_0_61, negated_conjecture, (~equalish(a,additive_identity))).
% 0.17/0.46 cnf(i_0_62, negated_conjecture, (~equalish(multiplicative_inverse(a),multiplicative_identity))).
% 0.17/0.46 cnf(i_0_52, plain, (equalish(X1,X1)|~defined(X1))).
% 0.17/0.46 cnf(i_0_43, plain, (defined(additive_inverse(X1))|~defined(X1))).
% 0.17/0.46 cnf(i_0_53, plain, (equalish(X1,X2)|~equalish(X2,X1))).
% 0.17/0.46 cnf(i_0_47, plain, (equalish(X1,X2)|~less_or_equal(X2,X1)|~less_or_equal(X1,X2))).
% 0.17/0.46 cnf(i_0_46, plain, (defined(multiplicative_inverse(X1))|equalish(X1,additive_identity)|~defined(X1))).
% 0.17/0.46 cnf(i_0_33, plain, (equalish(add(additive_identity,X1),X1)|~defined(X1))).
% 0.17/0.46 cnf(i_0_37, plain, (equalish(multiply(multiplicative_identity,X1),X1)|~defined(X1))).
% 0.17/0.46 cnf(i_0_54, plain, (equalish(X1,X2)|~equalish(X3,X2)|~equalish(X1,X3))).
% 0.17/0.46 cnf(i_0_38, plain, (equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)|equalish(X1,additive_identity)|~defined(X1))).
% 0.17/0.46 cnf(i_0_49, plain, (less_or_equal(X1,X2)|less_or_equal(X2,X1)|~defined(X2)|~defined(X1))).
% 0.17/0.46 cnf(i_0_41, plain, (defined(add(X1,X2))|~defined(X2)|~defined(X1))).
% 0.17/0.46 cnf(i_0_44, plain, (defined(multiply(X1,X2))|~defined(X2)|~defined(X1))).
% 0.17/0.46 cnf(i_0_57, plain, (less_or_equal(X1,X2)|~less_or_equal(X3,X2)|~equalish(X3,X1))).
% 0.17/0.46 cnf(i_0_48, plain, (less_or_equal(X1,X2)|~less_or_equal(X3,X2)|~less_or_equal(X1,X3))).
% 0.17/0.46 cnf(i_0_51, plain, (less_or_equal(additive_identity,multiply(X1,X2))|~less_or_equal(additive_identity,X2)|~less_or_equal(additive_identity,X1))).
% 0.17/0.46 cnf(i_0_34, plain, (equalish(add(X1,additive_inverse(X1)),additive_identity)|~defined(X1))).
% 0.17/0.46 cnf(i_0_55, plain, (equalish(add(X1,X2),add(X3,X2))|~defined(X2)|~equalish(X1,X3))).
% 0.17/0.46 cnf(i_0_56, plain, (equalish(multiply(X1,X2),multiply(X3,X2))|~defined(X2)|~equalish(X1,X3))).
% 0.17/0.46 cnf(i_0_35, plain, (equalish(add(X1,X2),add(X2,X1))|~defined(X2)|~defined(X1))).
% 0.17/0.46 cnf(i_0_39, plain, (equalish(multiply(X1,X2),multiply(X2,X1))|~defined(X2)|~defined(X1))).
% 0.17/0.46 cnf(i_0_50, plain, (less_or_equal(add(X1,X2),add(X3,X2))|~less_or_equal(X1,X3)|~defined(X2))).
% 0.17/0.46 cnf(i_0_32, plain, (equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3))|~defined(X3)|~defined(X2)|~defined(X1))).
% 0.17/0.46 cnf(i_0_36, plain, (equalish(multiply(X1,multiply(X2,X3)),multiply(multiply(X1,X2),X3))|~defined(X3)|~defined(X2)|~defined(X1))).
% 0.17/0.46 cnf(i_0_40, plain, (equalish(add(multiply(X1,X2),multiply(X3,X2)),multiply(add(X1,X3),X2))|~defined(X3)|~defined(X2)|~defined(X1))).
% 0.17/0.46 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.17/0.46 # Begin printing tableau
% 0.17/0.46 # Found 5 steps
% 0.17/0.46 cnf(i_0_61, negated_conjecture, (~equalish(a,additive_identity)), inference(start_rule)).
% 0.17/0.46 cnf(i_0_64, plain, (~equalish(a,additive_identity)), inference(extension_rule, [i_0_54])).
% 0.17/0.46 cnf(i_0_154, plain, (~equalish(a,multiplicative_identity)), inference(closure_rule, [i_0_60])).
% 0.17/0.46 cnf(i_0_153, plain, (~equalish(multiplicative_identity,additive_identity)), inference(extension_rule, [i_0_53])).
% 0.17/0.46 cnf(i_0_211, plain, (~equalish(additive_identity,multiplicative_identity)), inference(etableau_closure_rule, [i_0_211, ...])).
% 0.17/0.46 # End printing tableau
% 0.17/0.46 # SZS output end
% 0.17/0.46 # Branches closed with saturation will be marked with an "s"
% 0.17/0.46 # Child (9769) has found a proof.
% 0.17/0.46
% 0.17/0.46 # Proof search is over...
% 0.17/0.46 # Freeing feature tree
%------------------------------------------------------------------------------