TSTP Solution File: RNG039-2 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : RNG039-2 : TPTP v8.1.0. Released v1.0.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 : n022.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 : Mon Jul 18 20:27:10 EDT 2022

% Result   : Unsatisfiable 0.18s 0.47s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : RNG039-2 : TPTP v8.1.0. Released v1.0.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.32  % Computer : n022.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Mon May 30 16:58:22 EDT 2022
% 0.12/0.32  % CPUTime  : 
% 0.12/0.36  # No SInE strategy applied
% 0.12/0.36  # Auto-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PS_S3S
% 0.12/0.36  # and selection function SelectNewComplexAHPExceptUniqMaxHorn.
% 0.12/0.36  #
% 0.12/0.36  # Presaturation interreduction done
% 0.12/0.36  # Number of axioms: 74 Number of unprocessed: 74
% 0.12/0.36  # Tableaux proof search.
% 0.12/0.36  # APR header successfully linked.
% 0.12/0.36  # Hello from C++
% 0.12/0.36  # The folding up rule is enabled...
% 0.12/0.36  # Local unification is enabled...
% 0.12/0.36  # Any saturation attempts will use folding labels...
% 0.12/0.36  # 74 beginning clauses after preprocessing and clausification
% 0.12/0.36  # Creating start rules for all 3 conjectures.
% 0.12/0.36  # There are 3 start rule candidates:
% 0.12/0.36  # Found 50 unit axioms.
% 0.12/0.36  # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.36  # 3 start rule tableaux created.
% 0.12/0.36  # 24 extension rule candidate clauses
% 0.12/0.36  # 50 unit axiom clauses
% 0.12/0.36  
% 0.12/0.36  # Requested 8, 32 cores available to the main process.
% 0.12/0.36  # There are not enough tableaux to fork, creating more from the initial 3
% 0.12/0.36  # Returning from population with 27 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.36  # We now have 27 tableaux to operate on
% 0.18/0.47  # There were 1 total branch saturation attempts.
% 0.18/0.47  # There were 0 of these attempts blocked.
% 0.18/0.47  # There were 0 deferred branch saturation attempts.
% 0.18/0.47  # There were 0 free duplicated saturations.
% 0.18/0.47  # There were 1 total successful branch saturations.
% 0.18/0.47  # There were 0 successful branch saturations in interreduction.
% 0.18/0.47  # There were 0 successful branch saturations on the branch.
% 0.18/0.47  # There were 1 successful branch saturations after the branch.
% 0.18/0.47  # SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.47  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.47  # Begin clausification derivation
% 0.18/0.47  
% 0.18/0.47  # End clausification derivation
% 0.18/0.47  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.18/0.47  cnf(i_0_146, negated_conjecture, (product(a,b,c))).
% 0.18/0.47  cnf(i_0_115, plain, (product(a,c,c))).
% 0.18/0.47  cnf(i_0_147, negated_conjecture, (product(b,a,d))).
% 0.18/0.47  cnf(i_0_116, plain, (product(b,d,d))).
% 0.18/0.47  cnf(i_0_85, plain, (equalish(X1,X1))).
% 0.18/0.47  cnf(i_0_117, plain, (product(c,b,c))).
% 0.18/0.47  cnf(i_0_118, plain, (product(d,a,d))).
% 0.18/0.47  cnf(i_0_101, plain, (product(X1,additive_identity,additive_identity))).
% 0.18/0.47  cnf(i_0_100, plain, (product(additive_identity,X1,additive_identity))).
% 0.18/0.47  cnf(i_0_108, plain, (sum(X1,X1,additive_identity))).
% 0.18/0.47  cnf(i_0_112, plain, (equalish(multiply(a,b),c))).
% 0.18/0.47  cnf(i_0_113, plain, (equalish(multiply(b,a),d))).
% 0.18/0.47  cnf(i_0_130, plain, (product(a,b,multiply(a,c)))).
% 0.18/0.47  cnf(i_0_121, plain, (product(a,b,multiply(c,b)))).
% 0.18/0.47  cnf(i_0_127, plain, (product(a,d,multiply(c,a)))).
% 0.18/0.47  cnf(i_0_109, plain, (equalish(add(X1,additive_identity),X1))).
% 0.18/0.47  cnf(i_0_145, plain, (product(X1,X1,X1))).
% 0.18/0.47  cnf(i_0_88, plain, (sum(X1,additive_identity,X1))).
% 0.18/0.47  cnf(i_0_87, plain, (sum(additive_identity,X1,X1))).
% 0.18/0.47  cnf(i_0_110, plain, (equalish(add(X1,X1),additive_identity))).
% 0.18/0.47  cnf(i_0_111, plain, (equalish(multiply(X1,X1),X1))).
% 0.18/0.47  cnf(i_0_134, plain, (product(b,a,multiply(b,d)))).
% 0.18/0.47  cnf(i_0_124, plain, (product(b,a,multiply(d,a)))).
% 0.18/0.47  cnf(i_0_126, plain, (product(b,c,multiply(d,b)))).
% 0.18/0.47  cnf(i_0_136, plain, (product(c,a,multiply(a,d)))).
% 0.18/0.47  cnf(i_0_132, plain, (product(d,b,multiply(b,c)))).
% 0.18/0.47  cnf(i_0_122, plain, (product(a,multiply(b,c),c))).
% 0.18/0.47  cnf(i_0_125, plain, (product(b,multiply(a,d),d))).
% 0.18/0.47  cnf(i_0_131, plain, (product(multiply(c,a),b,c))).
% 0.18/0.47  cnf(i_0_135, plain, (product(multiply(d,b),a,d))).
% 0.18/0.47  cnf(i_0_114, plain, (sum(X1,X2,add(X2,X1)))).
% 0.18/0.47  cnf(i_0_138, plain, (product(a,add(a,b),add(a,c)))).
% 0.18/0.47  cnf(i_0_137, plain, (product(a,add(b,a),add(c,a)))).
% 0.18/0.47  cnf(i_0_139, plain, (product(b,add(a,b),add(d,b)))).
% 0.18/0.47  cnf(i_0_140, plain, (product(b,add(b,a),add(b,d)))).
% 0.18/0.47  cnf(i_0_144, plain, (product(add(a,b),a,add(a,d)))).
% 0.18/0.47  cnf(i_0_90, plain, (sum(X1,X2,add(X1,X2)))).
% 0.18/0.47  cnf(i_0_141, plain, (product(add(a,b),b,add(c,b)))).
% 0.18/0.47  cnf(i_0_89, plain, (product(X1,X2,multiply(X1,X2)))).
% 0.18/0.47  cnf(i_0_106, plain, (sum(X1,add(X1,X2),X2))).
% 0.18/0.47  cnf(i_0_107, plain, (sum(add(X1,X2),X2,X1))).
% 0.18/0.47  cnf(i_0_143, plain, (product(add(b,a),a,add(d,a)))).
% 0.18/0.47  cnf(i_0_142, plain, (product(add(b,a),b,add(b,c)))).
% 0.18/0.47  cnf(i_0_123, plain, (product(b,multiply(a,X1),multiply(d,X1)))).
% 0.18/0.47  cnf(i_0_129, plain, (product(multiply(X1,a),b,multiply(X1,c)))).
% 0.18/0.47  cnf(i_0_133, plain, (product(multiply(X1,b),a,multiply(X1,d)))).
% 0.18/0.47  cnf(i_0_120, plain, (product(a,multiply(b,X1),multiply(X2,X1)))).
% 0.18/0.47  cnf(i_0_119, plain, (product(X1,multiply(X1,X2),multiply(X1,X2)))).
% 0.18/0.47  cnf(i_0_128, plain, (product(multiply(X1,X2),X2,multiply(X1,X2)))).
% 0.18/0.47  cnf(i_0_148, negated_conjecture, (~equalish(c,d))).
% 0.18/0.47  cnf(i_0_86, plain, (equalish(X1,X2)|~equalish(X3,X2)|~equalish(X1,X3))).
% 0.18/0.47  cnf(i_0_93, plain, (sum(X1,X2,X3)|~sum(X2,X1,X3))).
% 0.18/0.47  cnf(i_0_76, plain, (equalish(add(X1,X2),add(X1,X3))|~equalish(X2,X3))).
% 0.18/0.47  cnf(i_0_105, plain, (equalish(X1,X2)|~sum(X3,X1,X4)|~sum(X3,X2,X4))).
% 0.18/0.47  cnf(i_0_104, plain, (equalish(X1,X2)|~sum(X1,X3,X4)|~sum(X2,X3,X4))).
% 0.18/0.47  cnf(i_0_102, plain, (equalish(X1,X2)|~sum(X3,X4,X2)|~sum(X3,X4,X1))).
% 0.18/0.47  cnf(i_0_103, plain, (equalish(X1,X2)|~product(X3,X4,X2)|~product(X3,X4,X1))).
% 0.18/0.47  cnf(i_0_84, plain, (product(X1,X2,X3)|~product(X1,X2,X4)|~equalish(X4,X3))).
% 0.18/0.47  cnf(i_0_83, plain, (product(X1,X2,X3)|~product(X1,X4,X3)|~equalish(X4,X2))).
% 0.18/0.47  cnf(i_0_82, plain, (product(X1,X2,X3)|~product(X4,X2,X3)|~equalish(X4,X1))).
% 0.18/0.47  cnf(i_0_75, plain, (equalish(add(X1,X2),add(X3,X2))|~equalish(X1,X3))).
% 0.18/0.47  cnf(i_0_81, plain, (equalish(multiply(X1,X2),multiply(X1,X3))|~equalish(X2,X3))).
% 0.18/0.47  cnf(i_0_79, plain, (sum(X1,X2,X3)|~sum(X1,X2,X4)|~equalish(X4,X3))).
% 0.18/0.47  cnf(i_0_78, plain, (sum(X1,X2,X3)|~sum(X1,X4,X3)|~equalish(X4,X2))).
% 0.18/0.47  cnf(i_0_77, plain, (sum(X1,X2,X3)|~sum(X4,X2,X3)|~equalish(X4,X1))).
% 0.18/0.47  cnf(i_0_80, plain, (equalish(multiply(X1,X2),multiply(X3,X2))|~equalish(X1,X3))).
% 0.18/0.47  cnf(i_0_95, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X5,X3)|~product(X6,X4,X1))).
% 0.18/0.47  cnf(i_0_94, plain, (product(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X1,X6,X4))).
% 0.18/0.47  cnf(i_0_92, plain, (sum(X1,X2,X3)|~sum(X4,X2,X5)|~sum(X6,X5,X3)|~sum(X6,X4,X1))).
% 0.18/0.47  cnf(i_0_91, plain, (sum(X1,X2,X3)|~sum(X4,X5,X3)|~sum(X6,X5,X2)|~sum(X1,X6,X4))).
% 0.18/0.47  cnf(i_0_99, plain, (product(X1,X2,X3)|~product(X4,X2,X5)|~product(X6,X2,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X1))).
% 0.18/0.47  cnf(i_0_96, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X4,X6,X2)|~product(X4,X7,X1)|~sum(X7,X6,X5))).
% 0.18/0.47  cnf(i_0_98, plain, (sum(X1,X2,X3)|~product(X4,X5,X3)|~product(X6,X5,X2)|~product(X7,X5,X1)|~sum(X7,X6,X4))).
% 0.18/0.47  cnf(i_0_97, plain, (product(X1,X2,X3)|~product(X1,X4,X5)|~product(X1,X6,X7)|~sum(X7,X5,X3)|~sum(X6,X4,X2))).
% 0.18/0.47  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.18/0.47  # Begin printing tableau
% 0.18/0.47  # Found 8 steps
% 0.18/0.47  cnf(i_0_147, negated_conjecture, (product(b,a,d)), inference(start_rule)).
% 0.18/0.47  cnf(i_0_150, plain, (product(b,a,d)), inference(extension_rule, [i_0_97])).
% 0.18/0.47  cnf(i_0_307, plain, (~product(b,d,d)), inference(closure_rule, [i_0_116])).
% 0.18/0.47  cnf(i_0_308, plain, (~sum(d,d,additive_identity)), inference(closure_rule, [i_0_108])).
% 0.18/0.47  cnf(i_0_309, plain, (~sum(d,a,add(a,d))), inference(closure_rule, [i_0_114])).
% 0.18/0.47  cnf(i_0_305, plain, (product(b,add(a,d),additive_identity)), inference(extension_rule, [i_0_103])).
% 0.18/0.47  cnf(i_0_328, plain, (~product(b,add(a,d),multiply(b,add(a,d)))), inference(closure_rule, [i_0_89])).
% 0.18/0.47  cnf(i_0_326, plain, (equalish(multiply(b,add(a,d)),additive_identity)), inference(etableau_closure_rule, [i_0_326, ...])).
% 0.18/0.47  # End printing tableau
% 0.18/0.47  # SZS output end
% 0.18/0.47  # Branches closed with saturation will be marked with an "s"
% 0.18/0.48  # Child (11337) has found a proof.
% 0.18/0.48  
% 0.18/0.48  # Proof search is over...
% 0.18/0.48  # Freeing feature tree
%------------------------------------------------------------------------------