TSTP Solution File: FLD005-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : FLD005-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 : n026.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:05:55 EDT 2022
% Result : Unsatisfiable 0.19s 0.43s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : FLD005-1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.11/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 : n026.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 7 03:38:16 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___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 0.13/0.37 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 30 Number of unprocessed: 30
% 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 # 30 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 6 unit axioms.
% 0.13/0.37 # 1 start rule tableaux created.
% 0.13/0.37 # 24 extension rule candidate clauses
% 0.13/0.37 # 6 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 # Returning from population with 14 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 14 tableaux to operate on
% 0.19/0.43 # There were 1 total branch saturation attempts.
% 0.19/0.43 # There were 0 of these attempts blocked.
% 0.19/0.43 # There were 0 deferred branch saturation attempts.
% 0.19/0.43 # There were 0 free duplicated saturations.
% 0.19/0.43 # There were 1 total successful branch saturations.
% 0.19/0.43 # There were 0 successful branch saturations in interreduction.
% 0.19/0.43 # There were 0 successful branch saturations on the branch.
% 0.19/0.43 # There were 1 successful branch saturations after the branch.
% 0.19/0.43 # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.43 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.43 # Begin clausification derivation
% 0.19/0.43
% 0.19/0.43 # End clausification derivation
% 0.19/0.43 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.43 cnf(i_0_58, hypothesis, (defined(a))).
% 0.19/0.43 cnf(i_0_59, hypothesis, (defined(b))).
% 0.19/0.43 cnf(i_0_41, plain, (defined(additive_identity))).
% 0.19/0.43 cnf(i_0_44, plain, (defined(multiplicative_identity))).
% 0.19/0.43 cnf(i_0_60, negated_conjecture, (~equalish(add(a,X1),b))).
% 0.19/0.43 cnf(i_0_57, plain, (~equalish(additive_identity,multiplicative_identity))).
% 0.19/0.43 cnf(i_0_42, plain, (defined(additive_inverse(X1))|~defined(X1))).
% 0.19/0.43 cnf(i_0_51, plain, (equalish(X1,X1)|~defined(X1))).
% 0.19/0.43 cnf(i_0_52, plain, (equalish(X1,X2)|~equalish(X2,X1))).
% 0.19/0.43 cnf(i_0_46, plain, (equalish(X1,X2)|~less_or_equal(X2,X1)|~less_or_equal(X1,X2))).
% 0.19/0.43 cnf(i_0_40, plain, (defined(add(X1,X2))|~defined(X2)|~defined(X1))).
% 0.19/0.43 cnf(i_0_32, plain, (equalish(add(additive_identity,X1),X1)|~defined(X1))).
% 0.19/0.43 cnf(i_0_53, plain, (equalish(X1,X2)|~equalish(X3,X2)|~equalish(X1,X3))).
% 0.19/0.43 cnf(i_0_45, plain, (defined(multiplicative_inverse(X1))|equalish(X1,additive_identity)|~defined(X1))).
% 0.19/0.43 cnf(i_0_36, plain, (equalish(multiply(multiplicative_identity,X1),X1)|~defined(X1))).
% 0.19/0.43 cnf(i_0_33, plain, (equalish(add(X1,additive_inverse(X1)),additive_identity)|~defined(X1))).
% 0.19/0.43 cnf(i_0_48, plain, (less_or_equal(X1,X2)|less_or_equal(X2,X1)|~defined(X2)|~defined(X1))).
% 0.19/0.43 cnf(i_0_43, plain, (defined(multiply(X1,X2))|~defined(X2)|~defined(X1))).
% 0.19/0.43 cnf(i_0_56, plain, (less_or_equal(X1,X2)|~less_or_equal(X3,X2)|~equalish(X3,X1))).
% 0.19/0.43 cnf(i_0_47, plain, (less_or_equal(X1,X2)|~less_or_equal(X3,X2)|~less_or_equal(X1,X3))).
% 0.19/0.43 cnf(i_0_50, plain, (less_or_equal(additive_identity,multiply(X1,X2))|~less_or_equal(additive_identity,X2)|~less_or_equal(additive_identity,X1))).
% 0.19/0.43 cnf(i_0_54, plain, (equalish(add(X1,X2),add(X3,X2))|~defined(X2)|~equalish(X1,X3))).
% 0.19/0.43 cnf(i_0_37, plain, (equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)|equalish(X1,additive_identity)|~defined(X1))).
% 0.19/0.43 cnf(i_0_34, plain, (equalish(add(X1,X2),add(X2,X1))|~defined(X2)|~defined(X1))).
% 0.19/0.43 cnf(i_0_49, plain, (less_or_equal(add(X1,X2),add(X3,X2))|~less_or_equal(X1,X3)|~defined(X2))).
% 0.19/0.43 cnf(i_0_55, plain, (equalish(multiply(X1,X2),multiply(X3,X2))|~defined(X2)|~equalish(X1,X3))).
% 0.19/0.43 cnf(i_0_38, plain, (equalish(multiply(X1,X2),multiply(X2,X1))|~defined(X2)|~defined(X1))).
% 0.19/0.43 cnf(i_0_31, plain, (equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3))|~defined(X3)|~defined(X2)|~defined(X1))).
% 0.19/0.43 cnf(i_0_35, plain, (equalish(multiply(X1,multiply(X2,X3)),multiply(multiply(X1,X2),X3))|~defined(X3)|~defined(X2)|~defined(X1))).
% 0.19/0.43 cnf(i_0_39, plain, (equalish(add(multiply(X1,X2),multiply(X3,X2)),multiply(add(X1,X3),X2))|~defined(X3)|~defined(X2)|~defined(X1))).
% 0.19/0.43 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.43 # Begin printing tableau
% 0.19/0.43 # Found 6 steps
% 0.19/0.43 cnf(i_0_60, negated_conjecture, (~equalish(add(a,additive_inverse(a)),b)), inference(start_rule)).
% 0.19/0.43 cnf(i_0_61, plain, (~equalish(add(a,additive_inverse(a)),b)), inference(extension_rule, [i_0_53])).
% 0.19/0.43 cnf(i_0_78, plain, (~equalish(add(a,additive_inverse(a)),additive_identity)), inference(extension_rule, [i_0_33])).
% 0.19/0.43 cnf(i_0_225, plain, (~defined(a)), inference(closure_rule, [i_0_58])).
% 0.19/0.43 cnf(i_0_77, plain, (~equalish(additive_identity,b)), inference(extension_rule, [i_0_52])).
% 0.19/0.43 cnf(i_0_277, plain, (~equalish(b,additive_identity)), inference(etableau_closure_rule, [i_0_277, ...])).
% 0.19/0.43 # End printing tableau
% 0.19/0.43 # SZS output end
% 0.19/0.43 # Branches closed with saturation will be marked with an "s"
% 0.19/0.44 # Child (25500) has found a proof.
% 0.19/0.44
% 0.19/0.44 # Proof search is over...
% 0.19/0.44 # Freeing feature tree
%------------------------------------------------------------------------------