TSTP Solution File: FLD013-2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : FLD013-2 : 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 : n028.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:58 EDT 2022
% Result : Unsatisfiable 0.22s 0.46s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : FLD013-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.08/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.16/0.36 % Computer : n028.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 600
% 0.16/0.36 % DateTime : Mon Jun 6 11:39:28 EDT 2022
% 0.16/0.36 % CPUTime :
% 0.16/0.39 # No SInE strategy applied
% 0.16/0.39 # Auto-Mode selected heuristic G_E___006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 0.16/0.39 # and selection function SelectNewComplexAHP.
% 0.16/0.39 #
% 0.16/0.39 # Number of axioms: 36 Number of unprocessed: 36
% 0.16/0.39 # Tableaux proof search.
% 0.16/0.39 # APR header successfully linked.
% 0.16/0.39 # Hello from C++
% 0.16/0.39 # The folding up rule is enabled...
% 0.16/0.39 # Local unification is enabled...
% 0.16/0.39 # Any saturation attempts will use folding labels...
% 0.16/0.39 # 36 beginning clauses after preprocessing and clausification
% 0.16/0.39 # Creating start rules for all 4 conjectures.
% 0.16/0.39 # There are 4 start rule candidates:
% 0.16/0.39 # Found 12 unit axioms.
% 0.16/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.16/0.39 # 4 start rule tableaux created.
% 0.16/0.39 # 24 extension rule candidate clauses
% 0.16/0.39 # 12 unit axiom clauses
% 0.16/0.39
% 0.16/0.39 # Requested 8, 32 cores available to the main process.
% 0.16/0.39 # There are not enough tableaux to fork, creating more from the initial 4
% 0.16/0.39 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux.
% 0.16/0.39 # We now have 11 tableaux to operate on
% 0.22/0.46 # There were 1 total branch saturation attempts.
% 0.22/0.46 # There were 0 of these attempts blocked.
% 0.22/0.46 # There were 0 deferred branch saturation attempts.
% 0.22/0.46 # There were 0 free duplicated saturations.
% 0.22/0.46 # There were 1 total successful branch saturations.
% 0.22/0.46 # There were 0 successful branch saturations in interreduction.
% 0.22/0.46 # There were 0 successful branch saturations on the branch.
% 0.22/0.46 # There were 1 successful branch saturations after the branch.
% 0.22/0.46 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.46 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.46 # Begin clausification derivation
% 0.22/0.46
% 0.22/0.46 # End clausification derivation
% 0.22/0.46 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.22/0.46 cnf(i_0_47, plain, (defined(additive_identity))).
% 0.22/0.46 cnf(i_0_50, plain, (defined(multiplicative_identity))).
% 0.22/0.46 cnf(i_0_64, hypothesis, (defined(a))).
% 0.22/0.46 cnf(i_0_65, hypothesis, (defined(b))).
% 0.22/0.46 cnf(i_0_66, hypothesis, (defined(c))).
% 0.22/0.46 cnf(i_0_67, hypothesis, (defined(d))).
% 0.22/0.46 cnf(i_0_68, hypothesis, (defined(u))).
% 0.22/0.46 cnf(i_0_69, negated_conjecture, (equalish(a,b))).
% 0.22/0.46 cnf(i_0_70, negated_conjecture, (equalish(c,d))).
% 0.22/0.46 cnf(i_0_48, plain, (defined(additive_inverse(X1))|~defined(X1))).
% 0.22/0.46 cnf(i_0_63, plain, (~equalish(additive_identity,multiplicative_identity))).
% 0.22/0.46 cnf(i_0_57, plain, (equalish(X1,X1)|~defined(X1))).
% 0.22/0.46 cnf(i_0_51, plain, (defined(multiplicative_inverse(X1))|equalish(X1,additive_identity)|~defined(X1))).
% 0.22/0.46 cnf(i_0_71, negated_conjecture, (equalish(add(a,c),u))).
% 0.22/0.46 cnf(i_0_58, plain, (equalish(X1,X2)|~equalish(X2,X1))).
% 0.22/0.46 cnf(i_0_54, plain, (less_or_equal(X2,X1)|less_or_equal(X1,X2)|~defined(X2)|~defined(X1))).
% 0.22/0.46 cnf(i_0_38, plain, (equalish(add(additive_identity,X1),X1)|~defined(X1))).
% 0.22/0.46 cnf(i_0_42, plain, (equalish(multiply(multiplicative_identity,X1),X1)|~defined(X1))).
% 0.22/0.46 cnf(i_0_46, plain, (defined(add(X1,X2))|~defined(X2)|~defined(X1))).
% 0.22/0.46 cnf(i_0_49, plain, (defined(multiply(X1,X2))|~defined(X2)|~defined(X1))).
% 0.22/0.46 cnf(i_0_72, negated_conjecture, (~equalish(add(d,b),u))).
% 0.22/0.46 cnf(i_0_39, plain, (equalish(add(X1,additive_inverse(X1)),additive_identity)|~defined(X1))).
% 0.22/0.46 cnf(i_0_59, plain, (equalish(X1,X2)|~equalish(X3,X2)|~equalish(X1,X3))).
% 0.22/0.46 cnf(i_0_52, plain, (equalish(X1,X2)|~less_or_equal(X2,X1)|~less_or_equal(X1,X2))).
% 0.22/0.46 cnf(i_0_62, plain, (less_or_equal(X1,X2)|~equalish(X3,X1)|~less_or_equal(X3,X2))).
% 0.22/0.46 cnf(i_0_53, plain, (less_or_equal(X1,X2)|~less_or_equal(X3,X2)|~less_or_equal(X1,X3))).
% 0.22/0.46 cnf(i_0_43, plain, (equalish(X1,additive_identity)|equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity)|~defined(X1))).
% 0.22/0.46 cnf(i_0_56, plain, (less_or_equal(additive_identity,multiply(X1,X2))|~less_or_equal(additive_identity,X2)|~less_or_equal(additive_identity,X1))).
% 0.22/0.46 cnf(i_0_40, plain, (equalish(add(X1,X2),add(X2,X1))|~defined(X2)|~defined(X1))).
% 0.22/0.46 cnf(i_0_44, plain, (equalish(multiply(X1,X2),multiply(X2,X1))|~defined(X2)|~defined(X1))).
% 0.22/0.46 cnf(i_0_60, plain, (equalish(add(X1,X2),add(X3,X2))|~defined(X2)|~equalish(X1,X3))).
% 0.22/0.46 cnf(i_0_61, plain, (equalish(multiply(X1,X2),multiply(X3,X2))|~defined(X2)|~equalish(X1,X3))).
% 0.22/0.46 cnf(i_0_55, plain, (less_or_equal(add(X1,X2),add(X3,X2))|~defined(X2)|~less_or_equal(X1,X3))).
% 0.22/0.46 cnf(i_0_37, plain, (equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3))|~defined(X3)|~defined(X2)|~defined(X1))).
% 0.22/0.46 cnf(i_0_41, plain, (equalish(multiply(X1,multiply(X2,X3)),multiply(multiply(X1,X2),X3))|~defined(X3)|~defined(X2)|~defined(X1))).
% 0.22/0.46 cnf(i_0_45, plain, (equalish(add(multiply(X1,X2),multiply(X3,X2)),multiply(add(X1,X3),X2))|~defined(X3)|~defined(X2)|~defined(X1))).
% 0.22/0.46 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.22/0.46 # Begin printing tableau
% 0.22/0.46 # Found 5 steps
% 0.22/0.46 cnf(i_0_70, negated_conjecture, (equalish(c,d)), inference(start_rule)).
% 0.22/0.46 cnf(i_0_75, plain, (equalish(c,d)), inference(extension_rule, [i_0_58])).
% 0.22/0.46 cnf(i_0_224, plain, (equalish(d,c)), inference(extension_rule, [i_0_59])).
% 0.22/0.46 cnf(i_0_251, plain, (~equalish(c,d)), inference(closure_rule, [i_0_70])).
% 0.22/0.46 cnf(i_0_249, plain, (equalish(c,c)), inference(etableau_closure_rule, [i_0_249, ...])).
% 0.22/0.46 # End printing tableau
% 0.22/0.46 # SZS output end
% 0.22/0.46 # Branches closed with saturation will be marked with an "s"
% 0.22/0.46 # Child (18274) has found a proof.
% 0.22/0.46
% 0.22/0.46 # Proof search is over...
% 0.22/0.46 # Freeing feature tree
%------------------------------------------------------------------------------