TSTP Solution File: FLD007-3 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : FLD007-3 : 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 : n029.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:56 EDT 2022
% Result : Unsatisfiable 0.20s 0.41s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : FLD007-3 : 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.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 6 19:46:50 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.38 # No SInE strategy applied
% 0.14/0.38 # Auto-Mode selected heuristic G_E___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 0.14/0.38 # and selection function PSelectComplexExceptUniqMaxHorn.
% 0.14/0.38 #
% 0.14/0.38 # Presaturation interreduction done
% 0.14/0.38 # Number of axioms: 28 Number of unprocessed: 28
% 0.14/0.38 # Tableaux proof search.
% 0.14/0.38 # APR header successfully linked.
% 0.14/0.38 # Hello from C++
% 0.14/0.39 # The folding up rule is enabled...
% 0.14/0.39 # Local unification is enabled...
% 0.14/0.39 # Any saturation attempts will use folding labels...
% 0.14/0.39 # 28 beginning clauses after preprocessing and clausification
% 0.14/0.39 # Creating start rules for all 1 conjectures.
% 0.14/0.39 # There are 1 start rule candidates:
% 0.14/0.39 # Found 5 unit axioms.
% 0.14/0.39 # 1 start rule tableaux created.
% 0.14/0.39 # 23 extension rule candidate clauses
% 0.14/0.39 # 5 unit axiom clauses
% 0.14/0.39
% 0.14/0.39 # Requested 8, 32 cores available to the main process.
% 0.14/0.39 # There are not enough tableaux to fork, creating more from the initial 1
% 0.14/0.39 # Returning from population with 8 new_tableaux and 0 remaining starting tableaux.
% 0.14/0.39 # We now have 8 tableaux to operate on
% 0.20/0.41 # There were 3 total branch saturation attempts.
% 0.20/0.41 # There were 0 of these attempts blocked.
% 0.20/0.41 # There were 0 deferred branch saturation attempts.
% 0.20/0.41 # There were 0 free duplicated saturations.
% 0.20/0.41 # There were 3 total successful branch saturations.
% 0.20/0.41 # There were 0 successful branch saturations in interreduction.
% 0.20/0.41 # There were 0 successful branch saturations on the branch.
% 0.20/0.41 # There were 3 successful branch saturations after the branch.
% 0.20/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.41 # Begin clausification derivation
% 0.20/0.41
% 0.20/0.41 # End clausification derivation
% 0.20/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.41 cnf(i_0_42, plain, (defined(additive_identity))).
% 0.20/0.41 cnf(i_0_55, hypothesis, (defined(a))).
% 0.20/0.41 cnf(i_0_45, plain, (defined(multiplicative_identity))).
% 0.20/0.41 cnf(i_0_56, negated_conjecture, (~sum(additive_identity,additive_inverse(additive_inverse(a)),a))).
% 0.20/0.41 cnf(i_0_54, plain, (~sum(additive_identity,additive_identity,multiplicative_identity))).
% 0.20/0.41 cnf(i_0_43, plain, (defined(additive_inverse(X1))|~defined(X1))).
% 0.20/0.41 cnf(i_0_31, plain, (sum(additive_identity,X1,X1)|~defined(X1))).
% 0.20/0.41 cnf(i_0_36, plain, (product(multiplicative_identity,X1,X1)|~defined(X1))).
% 0.20/0.41 cnf(i_0_41, plain, (defined(add(X1,X2))|~defined(X2)|~defined(X1))).
% 0.20/0.41 cnf(i_0_44, plain, (defined(multiply(X1,X2))|~defined(X2)|~defined(X1))).
% 0.20/0.41 cnf(i_0_33, plain, (sum(X1,X2,X3)|~sum(X2,X1,X3))).
% 0.20/0.41 cnf(i_0_32, plain, (sum(additive_inverse(X1),X1,additive_identity)|~defined(X1))).
% 0.20/0.41 cnf(i_0_46, plain, (defined(multiplicative_inverse(X1))|sum(additive_identity,X1,additive_identity)|~defined(X1))).
% 0.20/0.41 cnf(i_0_49, plain, (sum(additive_identity,X1,X2)|~less_or_equal(X2,X1)|~less_or_equal(X1,X2))).
% 0.20/0.41 cnf(i_0_38, plain, (product(X1,X2,X3)|~product(X2,X1,X3))).
% 0.20/0.41 cnf(i_0_50, plain, (less_or_equal(X1,X2)|~less_or_equal(X3,X2)|~less_or_equal(X1,X3))).
% 0.20/0.41 cnf(i_0_51, plain, (less_or_equal(X1,X2)|less_or_equal(X2,X1)|~defined(X2)|~defined(X1))).
% 0.20/0.41 cnf(i_0_37, plain, (product(multiplicative_inverse(X1),X1,multiplicative_identity)|sum(additive_identity,X1,additive_identity)|~defined(X1))).
% 0.20/0.41 cnf(i_0_47, plain, (sum(X1,X2,add(X1,X2))|~defined(X2)|~defined(X1))).
% 0.20/0.41 cnf(i_0_48, plain, (product(X1,X2,multiply(X1,X2))|~defined(X2)|~defined(X1))).
% 0.20/0.41 cnf(i_0_52, plain, (less_or_equal(X1,X2)|~less_or_equal(X3,X4)|~sum(X4,X5,X2)|~sum(X3,X5,X1))).
% 0.20/0.41 cnf(i_0_53, plain, (less_or_equal(additive_identity,X1)|~less_or_equal(additive_identity,X2)|~less_or_equal(additive_identity,X3)|~product(X3,X2,X1))).
% 0.20/0.41 cnf(i_0_29, plain, (sum(X1,X2,X3)|~sum(X4,X5,X3)|~sum(X6,X5,X2)|~sum(X1,X6,X4))).
% 0.20/0.41 cnf(i_0_30, plain, (sum(X1,X2,X3)|~sum(X4,X2,X5)|~sum(X6,X5,X3)|~sum(X6,X4,X1))).
% 0.20/0.41 cnf(i_0_34, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))).
% 0.20/0.41 cnf(i_0_35, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))).
% 0.20/0.41 cnf(i_0_39, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X7,X5,X1)|~sum(X7,X6,X4))).
% 0.20/0.41 cnf(i_0_40, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X2,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X1))).
% 0.20/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.41 # Begin printing tableau
% 0.20/0.41 # Found 9 steps
% 0.20/0.41 cnf(i_0_56, negated_conjecture, (~sum(additive_identity,additive_inverse(additive_inverse(a)),a)), inference(start_rule)).
% 0.20/0.41 cnf(i_0_57, plain, (~sum(additive_identity,additive_inverse(additive_inverse(a)),a)), inference(extension_rule, [i_0_33])).
% 0.20/0.41 cnf(i_0_71, plain, (~sum(additive_inverse(additive_inverse(a)),additive_identity,a)), inference(extension_rule, [i_0_29])).
% 0.20/0.41 cnf(i_0_331, plain, (~sum(additive_identity,a,a)), inference(extension_rule, [i_0_31])).
% 0.20/0.41 cnf(i_0_337, plain, (~defined(a)), inference(closure_rule, [i_0_55])).
% 0.20/0.41 cnf(i_0_332, plain, (~sum(additive_inverse(a),a,additive_identity)), inference(extension_rule, [i_0_33])).
% 0.20/0.41 cnf(i_0_333, plain, (~sum(additive_inverse(additive_inverse(a)),additive_inverse(a),additive_identity)), inference(extension_rule, [i_0_32])).
% 0.20/0.41 cnf(i_0_349, plain, (~sum(a,additive_inverse(a),additive_identity)), inference(etableau_closure_rule, [i_0_349, ...])).
% 0.20/0.41 cnf(i_0_361, plain, (~defined(additive_inverse(a))), inference(etableau_closure_rule, [i_0_361, ...])).
% 0.20/0.41 # End printing tableau
% 0.20/0.41 # SZS output end
% 0.20/0.41 # Branches closed with saturation will be marked with an "s"
% 0.20/0.41 # Child (24919) has found a proof.
% 0.20/0.41
% 0.20/0.41 # Proof search is over...
% 0.20/0.41 # Freeing feature tree
%------------------------------------------------------------------------------