TSTP Solution File: FLD013-5 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : FLD013-5 : 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 : n027.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:59 EDT 2022
% Result : Unsatisfiable 0.19s 0.39s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : FLD013-5 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/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.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 6 23:54:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 # No SInE strategy applied
% 0.13/0.36 # Auto-Mode selected heuristic G_E___006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 0.13/0.36 # and selection function SelectNewComplexAHP.
% 0.13/0.36 #
% 0.13/0.36 # Number of axioms: 37 Number of unprocessed: 37
% 0.13/0.36 # Tableaux proof search.
% 0.13/0.36 # APR header successfully linked.
% 0.13/0.36 # 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 # 37 beginning clauses after preprocessing and clausification
% 0.13/0.37 # Creating start rules for all 5 conjectures.
% 0.13/0.37 # There are 5 start rule candidates:
% 0.13/0.37 # Found 14 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 5 start rule tableaux created.
% 0.13/0.37 # 23 extension rule candidate clauses
% 0.13/0.37 # 14 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 5
% 0.13/0.37 # Returning from population with 20 new_tableaux and 0 remaining starting tableaux.
% 0.13/0.37 # We now have 20 tableaux to operate on
% 0.19/0.39 # There were 2 total branch saturation attempts.
% 0.19/0.39 # There were 0 of these attempts blocked.
% 0.19/0.39 # There were 0 deferred branch saturation attempts.
% 0.19/0.39 # There were 0 free duplicated saturations.
% 0.19/0.39 # There were 2 total successful branch saturations.
% 0.19/0.39 # There were 0 successful branch saturations in interreduction.
% 0.19/0.39 # There were 0 successful branch saturations on the branch.
% 0.19/0.39 # There were 2 successful branch saturations after the branch.
% 0.19/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.39 # Begin clausification derivation
% 0.19/0.39
% 0.19/0.39 # End clausification derivation
% 0.19/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.39 cnf(i_0_51, plain, (defined(additive_identity))).
% 0.19/0.39 cnf(i_0_54, plain, (defined(multiplicative_identity))).
% 0.19/0.39 cnf(i_0_64, hypothesis, (defined(a))).
% 0.19/0.39 cnf(i_0_65, hypothesis, (defined(b))).
% 0.19/0.39 cnf(i_0_66, hypothesis, (defined(c))).
% 0.19/0.39 cnf(i_0_67, hypothesis, (defined(d))).
% 0.19/0.39 cnf(i_0_68, hypothesis, (defined(u))).
% 0.19/0.39 cnf(i_0_69, hypothesis, (defined(v))).
% 0.19/0.39 cnf(i_0_52, plain, (defined(additive_inverse(X1))|~defined(X1))).
% 0.19/0.39 cnf(i_0_60, plain, (less_or_equal(X2,X1)|less_or_equal(X1,X2)|~defined(X2)|~defined(X1))).
% 0.19/0.39 cnf(i_0_50, plain, (defined(add(X1,X2))|~defined(X2)|~defined(X1))).
% 0.19/0.39 cnf(i_0_53, plain, (defined(multiply(X1,X2))|~defined(X2)|~defined(X1))).
% 0.19/0.39 cnf(i_0_70, negated_conjecture, (sum(additive_identity,a,b))).
% 0.19/0.39 cnf(i_0_71, negated_conjecture, (sum(additive_identity,c,d))).
% 0.19/0.39 cnf(i_0_72, negated_conjecture, (sum(a,c,u))).
% 0.19/0.39 cnf(i_0_73, negated_conjecture, (sum(d,b,v))).
% 0.19/0.39 cnf(i_0_59, plain, (less_or_equal(X1,X2)|~less_or_equal(X3,X2)|~less_or_equal(X1,X3))).
% 0.19/0.39 cnf(i_0_40, plain, (sum(additive_identity,X1,X1)|~defined(X1))).
% 0.19/0.39 cnf(i_0_45, plain, (product(multiplicative_identity,X1,X1)|~defined(X1))).
% 0.19/0.39 cnf(i_0_41, plain, (sum(additive_inverse(X1),X1,additive_identity)|~defined(X1))).
% 0.19/0.39 cnf(i_0_55, plain, (defined(multiplicative_inverse(X1))|sum(additive_identity,X1,additive_identity)|~defined(X1))).
% 0.19/0.39 cnf(i_0_63, plain, (~sum(additive_identity,additive_identity,multiplicative_identity))).
% 0.19/0.39 cnf(i_0_74, negated_conjecture, (~sum(additive_identity,u,v))).
% 0.19/0.39 cnf(i_0_56, plain, (sum(X1,X2,add(X1,X2))|~defined(X2)|~defined(X1))).
% 0.19/0.39 cnf(i_0_57, plain, (product(X1,X2,multiply(X1,X2))|~defined(X2)|~defined(X1))).
% 0.19/0.39 cnf(i_0_58, plain, (sum(additive_identity,X1,X2)|~less_or_equal(X2,X1)|~less_or_equal(X1,X2))).
% 0.19/0.39 cnf(i_0_46, plain, (sum(additive_identity,X1,additive_identity)|product(multiplicative_inverse(X1),X1,multiplicative_identity)|~defined(X1))).
% 0.19/0.39 cnf(i_0_62, plain, (less_or_equal(additive_identity,X1)|~less_or_equal(additive_identity,X3)|~less_or_equal(additive_identity,X2)|~product(X2,X3,X1))).
% 0.19/0.39 cnf(i_0_42, plain, (sum(X1,X2,X3)|~sum(X2,X1,X3))).
% 0.19/0.39 cnf(i_0_47, plain, (product(X1,X2,X3)|~product(X2,X1,X3))).
% 0.19/0.39 cnf(i_0_61, plain, (less_or_equal(X1,X2)|~less_or_equal(X3,X4)|~sum(X4,X5,X2)|~sum(X3,X5,X1))).
% 0.19/0.39 cnf(i_0_38, plain, (sum(X1,X2,X3)|~sum(X5,X6,X3)|~sum(X4,X6,X2)|~sum(X1,X4,X5))).
% 0.19/0.39 cnf(i_0_39, plain, (sum(X1,X2,X3)|~sum(X5,X2,X6)|~sum(X4,X6,X3)|~sum(X4,X5,X1))).
% 0.19/0.39 cnf(i_0_43, plain, (product(X1,X2,X3)|~product(X5,X6,X3)|~product(X4,X6,X2)|~product(X1,X4,X5))).
% 0.19/0.39 cnf(i_0_44, plain, (product(X1,X2,X3)|~product(X5,X2,X6)|~product(X4,X6,X3)|~product(X4,X5,X1))).
% 0.19/0.39 cnf(i_0_48, plain, (sum(X1,X2,X3)|~sum(X4,X5,X6)|~product(X6,X7,X3)|~product(X5,X7,X2)|~product(X4,X7,X1))).
% 0.19/0.39 cnf(i_0_49, plain, (product(X1,X2,X3)|~sum(X6,X7,X3)|~sum(X4,X5,X1)|~product(X5,X2,X7)|~product(X4,X2,X6))).
% 0.19/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.39 # Begin printing tableau
% 0.19/0.39 # Found 6 steps
% 0.19/0.39 cnf(i_0_71, negated_conjecture, (sum(additive_identity,c,d)), inference(start_rule)).
% 0.19/0.39 cnf(i_0_78, plain, (sum(additive_identity,c,d)), inference(extension_rule, [i_0_42])).
% 0.19/0.39 cnf(i_0_268, plain, (sum(c,additive_identity,d)), inference(extension_rule, [i_0_61])).
% 0.19/0.39 cnf(i_0_315, plain, (~sum(c,additive_identity,d)), inference(closure_rule, [i_0_268])).
% 0.19/0.39 cnf(i_0_312, plain, (less_or_equal(d,d)), inference(etableau_closure_rule, [i_0_312, ...])).
% 0.19/0.39 cnf(i_0_313, plain, (~less_or_equal(c,c)), inference(etableau_closure_rule, [i_0_313, ...])).
% 0.19/0.39 # End printing tableau
% 0.19/0.39 # SZS output end
% 0.19/0.39 # Branches closed with saturation will be marked with an "s"
% 0.19/0.39 # Child (8322) has found a proof.
% 0.19/0.39
% 0.19/0.39 # Proof search is over...
% 0.19/0.39 # Freeing feature tree
%------------------------------------------------------------------------------