TSTP Solution File: SYN533-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN533-1 : TPTP v8.1.0. Released 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 : n006.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 : Thu Jul 21 06:12:11 EDT 2022
% Result : Satisfiable 0.12s 0.38s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN533-1 : TPTP v8.1.0. Released v2.1.0.
% 0.11/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.34 % Computer : n006.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 11:35:50 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_OS_S1U
% 0.12/0.37 # and selection function SelectComplexAHPExceptRRHorn.
% 0.12/0.37 #
% 0.12/0.37 # Number of axioms: 92 Number of unprocessed: 92
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # Hello from C++
% 0.12/0.37 # The folding up rule is enabled...
% 0.12/0.37 # Local unification is enabled...
% 0.12/0.37 # Any saturation attempts will use folding labels...
% 0.12/0.37 # 92 beginning clauses after preprocessing and clausification
% 0.12/0.37 # Creating start rules for all 92 conjectures.
% 0.12/0.37 # There are 92 start rule candidates:
% 0.12/0.37 # Found 1 unit axioms.
% 0.12/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.37 # 92 start rule tableaux created.
% 0.12/0.37 # 91 extension rule candidate clauses
% 0.12/0.37 # 1 unit axiom clauses
% 0.12/0.37
% 0.12/0.37 # Requested 8, 32 cores available to the main process.
% 0.12/0.38 # 32012 Satisfiable branch
% 0.12/0.38 # Satisfiable branch found.
% 0.12/0.38 # There were 1 total branch saturation attempts.
% 0.12/0.38 # There were 0 of these attempts blocked.
% 0.12/0.38 # There were 0 deferred branch saturation attempts.
% 0.12/0.38 # There were 0 free duplicated saturations.
% 0.12/0.38 # There were 0 total successful branch saturations.
% 0.12/0.38 # There were 0 successful branch saturations in interreduction.
% 0.12/0.38 # There were 0 successful branch saturations on the branch.
% 0.12/0.38 # There were 0 successful branch saturations after the branch.
% 0.12/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.38 # Begin clausification derivation
% 0.12/0.38
% 0.12/0.38 # End clausification derivation
% 0.12/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.38 cnf(i_0_93, negated_conjecture, (c4_0)).
% 0.12/0.38 cnf(i_0_95, negated_conjecture, (ndr1_0|c1_0)).
% 0.12/0.38 cnf(i_0_96, negated_conjecture, (ndr1_0|c2_0)).
% 0.12/0.38 cnf(i_0_97, negated_conjecture, (ndr1_0|c3_0)).
% 0.12/0.38 cnf(i_0_98, negated_conjecture, (ndr1_0|ssSkC2)).
% 0.12/0.38 cnf(i_0_99, negated_conjecture, (ndr1_0|ssSkC1)).
% 0.12/0.38 cnf(i_0_100, negated_conjecture, (ndr1_0|ssSkC0)).
% 0.12/0.38 cnf(i_0_94, negated_conjecture, (ndr1_0|~ssSkC3)).
% 0.12/0.38 cnf(i_0_125, negated_conjecture, (c1_0|c2_0|~c3_0)).
% 0.12/0.38 cnf(i_0_121, negated_conjecture, (ndr1_0|~c1_0|~ssSkC1)).
% 0.12/0.38 cnf(i_0_120, negated_conjecture, (ndr1_0|~c3_0|~ssSkC2)).
% 0.12/0.38 cnf(i_0_101, negated_conjecture, (c1_0|c4_1(a467))).
% 0.12/0.38 cnf(i_0_102, negated_conjecture, (c1_0|c5_1(a467))).
% 0.12/0.38 cnf(i_0_103, negated_conjecture, (c2_0|ndr1_1(a465))).
% 0.12/0.38 cnf(i_0_104, negated_conjecture, (c2_0|c3_1(a464))).
% 0.12/0.39 cnf(i_0_105, negated_conjecture, (c3_0|ndr1_1(a445))).
% 0.12/0.39 cnf(i_0_106, negated_conjecture, (c3_0|c3_1(a445))).
% 0.12/0.39 cnf(i_0_108, negated_conjecture, (ssSkC2|ndr1_1(a458))).
% 0.12/0.39 cnf(i_0_109, negated_conjecture, (ssSkC2|c1_1(a458))).
% 0.12/0.39 cnf(i_0_110, negated_conjecture, (ssSkC1|ndr1_1(a453))).
% 0.12/0.39 cnf(i_0_111, negated_conjecture, (ssSkC0|ndr1_1(a447))).
% 0.12/0.39 cnf(i_0_135, negated_conjecture, (c1_0|ndr1_1(a461)|~c2_0)).
% 0.12/0.39 cnf(i_0_136, negated_conjecture, (c1_0|c1_1(a461)|~c2_0)).
% 0.12/0.39 cnf(i_0_122, negated_conjecture, (c2_0|ndr1_1(a449)|~ssSkC0)).
% 0.12/0.39 cnf(i_0_139, negated_conjecture, (c2_0|ndr1_1(a451)|~c5_0)).
% 0.12/0.39 cnf(i_0_140, negated_conjecture, (c2_0|c3_1(a451)|~c5_0)).
% 0.12/0.39 cnf(i_0_123, negated_conjecture, (c2_0|c1_1(a449)|~ssSkC0)).
% 0.12/0.39 cnf(i_0_124, negated_conjecture, (c2_0|c2_1(a449)|~ssSkC0)).
% 0.12/0.39 cnf(i_0_138, negated_conjecture, (ndr1_1(a455)|~c1_0|~ssSkC1)).
% 0.12/0.39 cnf(i_0_137, negated_conjecture, (c2_1(a460)|~c3_0|~ssSkC2)).
% 0.12/0.39 cnf(i_0_115, negated_conjecture, (c1_0|~c3_1(a467))).
% 0.12/0.39 cnf(i_0_117, negated_conjecture, (c2_0|~c5_1(a465))).
% 0.12/0.39 cnf(i_0_118, negated_conjecture, (c2_0|~c5_1(a464))).
% 0.12/0.39 cnf(i_0_119, negated_conjecture, (c2_0|~c2_1(a464))).
% 0.12/0.39 cnf(i_0_129, negated_conjecture, (ssSkC2|~c5_1(a458))).
% 0.12/0.39 cnf(i_0_131, negated_conjecture, (ssSkC1|~c4_1(a453))).
% 0.12/0.39 cnf(i_0_114, negated_conjecture, (~ssSkC3|~c5_1(a470))).
% 0.12/0.39 cnf(i_0_113, negated_conjecture, (~ssSkC3|~c3_1(a470))).
% 0.12/0.39 cnf(i_0_163, negated_conjecture, (c2_0|~c5_0|~c4_1(a451))).
% 0.12/0.39 cnf(i_0_161, negated_conjecture, (~c1_0|~ssSkC1|~c1_1(a455))).
% 0.12/0.39 cnf(i_0_156, negated_conjecture, (~c3_0|~ssSkC2|~c1_1(a460))).
% 0.12/0.39 cnf(i_0_107, negated_conjecture, (ndr1_1(X1)|ssSkP1(X1))).
% 0.12/0.39 cnf(i_0_112, negated_conjecture, (ndr1_1(X1)|ssSkP0(X1))).
% 0.12/0.39 cnf(i_0_166, negated_conjecture, (c1_0|c3_1(X1)|c2_1(X1)|~ndr1_0)).
% 0.12/0.39 cnf(i_0_116, negated_conjecture, (c2_0|c1_2(a465,a466))).
% 0.12/0.39 cnf(i_0_128, negated_conjecture, (ssSkC2|c5_2(a458,a459))).
% 0.12/0.39 cnf(i_0_130, negated_conjecture, (ssSkC1|c5_2(a453,a454))).
% 0.12/0.39 cnf(i_0_154, negated_conjecture, (c1_0|c1_2(a461,a463)|~c2_0)).
% 0.12/0.39 cnf(i_0_155, negated_conjecture, (c1_0|c1_2(a461,a462)|~c2_0)).
% 0.12/0.39 cnf(i_0_153, negated_conjecture, (c1_0|c2_2(a461,a463)|~c2_0)).
% 0.12/0.39 cnf(i_0_141, negated_conjecture, (c2_0|c5_2(a449,a450)|~ssSkC0)).
% 0.12/0.39 cnf(i_0_162, negated_conjecture, (c2_0|c3_2(a451,a452)|~c5_0)).
% 0.12/0.39 cnf(i_0_157, negated_conjecture, (c1_2(a455,a457)|~c1_0|~ssSkC1)).
% 0.12/0.39 cnf(i_0_158, negated_conjecture, (c2_2(a455,a457)|~c1_0|~ssSkC1)).
% 0.12/0.39 cnf(i_0_159, negated_conjecture, (c2_2(a455,a456)|~c1_0|~ssSkC1)).
% 0.12/0.39 cnf(i_0_160, negated_conjecture, (c3_2(a455,a456)|~c1_0|~ssSkC1)).
% 0.12/0.39 cnf(i_0_172, negated_conjecture, (c2_0|c3_0|c2_1(X1)|~ndr1_0|~c3_1(X1))).
% 0.12/0.39 cnf(i_0_126, negated_conjecture, (ssSkP1(X1)|c2_2(X1,a468))).
% 0.12/0.39 cnf(i_0_127, negated_conjecture, (ssSkP1(X1)|c5_2(X1,a468))).
% 0.12/0.39 cnf(i_0_132, negated_conjecture, (ssSkP0(X1)|c3_2(X1,a443))).
% 0.12/0.39 cnf(i_0_173, negated_conjecture, (ssSkC3|ndr1_1(X1)|c1_1(X1)|~ndr1_0|~ssSkP1(X1))).
% 0.12/0.39 cnf(i_0_133, negated_conjecture, (c2_0|~c5_2(a465,a466))).
% 0.12/0.39 cnf(i_0_134, negated_conjecture, (c2_0|~c4_2(a465,a466))).
% 0.12/0.39 cnf(i_0_143, negated_conjecture, (c3_0|~c2_2(a445,a446))).
% 0.12/0.39 cnf(i_0_142, negated_conjecture, (c3_0|~c4_2(a445,a446))).
% 0.12/0.39 cnf(i_0_145, negated_conjecture, (ssSkC2|~c1_2(a458,a459))).
% 0.12/0.39 cnf(i_0_146, negated_conjecture, (ssSkC2|~c3_2(a458,a459))).
% 0.12/0.39 cnf(i_0_147, negated_conjecture, (ssSkC1|~c1_2(a453,a454))).
% 0.12/0.39 cnf(i_0_148, negated_conjecture, (ssSkC1|~c3_2(a453,a454))).
% 0.12/0.39 cnf(i_0_149, negated_conjecture, (ssSkC0|~c1_2(a447,a448))).
% 0.12/0.39 cnf(i_0_151, negated_conjecture, (ssSkC0|~c2_2(a447,a448))).
% 0.12/0.39 cnf(i_0_150, negated_conjecture, (ssSkC0|~c4_2(a447,a448))).
% 0.12/0.39 cnf(i_0_167, negated_conjecture, (c1_0|~c2_0|~c5_2(a461,a462))).
% 0.12/0.39 cnf(i_0_168, negated_conjecture, (c1_0|~c2_0|~c4_2(a461,a462))).
% 0.12/0.39 cnf(i_0_164, negated_conjecture, (c2_0|~ssSkC0|~c2_2(a449,a450))).
% 0.12/0.39 cnf(i_0_165, negated_conjecture, (c2_0|~ssSkC0|~c3_2(a449,a450))).
% 0.12/0.39 cnf(i_0_171, negated_conjecture, (c2_0|~c5_0|~c2_2(a451,a452))).
% 0.12/0.39 cnf(i_0_174, negated_conjecture, (c3_2(a460,X1)|~c3_0|~ssSkC2|~ndr1_1(a460))).
% 0.12/0.39 cnf(i_0_169, negated_conjecture, (~c1_0|~ssSkC1|~c4_2(a455,a457))).
% 0.12/0.39 cnf(i_0_170, negated_conjecture, (~c1_0|~ssSkC1|~c4_2(a455,a456))).
% 0.12/0.39 cnf(i_0_144, negated_conjecture, (ssSkP1(X1)|~c1_2(X1,a468))).
% 0.12/0.39 cnf(i_0_152, negated_conjecture, (ssSkP0(X1)|~c1_2(X1,a443))).
% 0.12/0.39 cnf(i_0_177, negated_conjecture, (ssSkC3|c1_1(X1)|c2_2(X1,a469)|~ndr1_0|~ssSkP1(X1))).
% 0.12/0.39 cnf(i_0_175, negated_conjecture, (ssSkC3|c1_1(X1)|c5_2(X1,a469)|~ndr1_0|~ssSkP1(X1))).
% 0.12/0.39 cnf(i_0_176, negated_conjecture, (ssSkC3|c1_1(X1)|c4_2(X1,a469)|~ndr1_0|~ssSkP1(X1))).
% 0.12/0.39 cnf(i_0_178, negated_conjecture, (ssSkC0|c1_2(a447,X1)|c3_2(a447,X1)|~ndr1_1(a447)|~c5_2(a447,X1))).
% 0.12/0.39 cnf(i_0_180, negated_conjecture, (c2_0|c2_1(X1)|c5_2(X1,X2)|~ndr1_0|~c1_0|~ndr1_1(X1)|~c3_1(X1)|~c2_2(X1,X2))).
% 0.12/0.39 cnf(i_0_179, negated_conjecture, (c1_0|c3_0|c5_2(X1,X2)|c4_2(X1,X2)|~ndr1_0|~ndr1_1(X1)|~c1_1(X1)|~c3_2(X1,X2))).
% 0.12/0.39 cnf(i_0_181, negated_conjecture, (c2_1(X1)|c2_2(X2,X3)|c5_2(X2,X3)|c4_2(X2,X3)|~ndr1_0|~c4_1(X2)|~ndr1_1(X2)|~c3_1(X1)|~c1_1(X2))).
% 0.12/0.39 cnf(i_0_182, negated_conjecture, (c1_0|ndr1_1(X1)|c1_2(X2,X3)|c3_2(X2,X4)|c4_2(X2,X3)|~ndr1_0|~ndr1_1(X2)|~ssSkP0(X1)|~c2_1(X1)|~c5_2(X2,X4)|~c3_2(X2,X3))).
% 0.12/0.39 cnf(i_0_183, negated_conjecture, (c1_0|c1_2(X2,X3)|c3_2(X2,X4)|c4_2(X2,X3)|~ndr1_0|~ndr1_1(X2)|~ssSkP0(X1)|~c2_1(X1)|~c5_2(X2,X4)|~c3_2(X2,X3)|~c5_2(X1,a444))).
% 0.12/0.39 cnf(i_0_184, negated_conjecture, (c1_0|c1_2(X2,X3)|c3_2(X2,X4)|c4_2(X2,X3)|~ndr1_0|~ndr1_1(X2)|~ssSkP0(X1)|~c2_1(X1)|~c5_2(X2,X4)|~c3_2(X2,X3)|~c3_2(X1,a444))).
% 0.12/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.39 # Begin printing tableau
% 0.12/0.39 # Found 3 steps
% 0.12/0.39 cnf(i_0_169, negated_conjecture, (~c1_0|~ssSkC1|~c4_2(a455,a457)), inference(start_rule)).
% 0.12/0.39 cnf(i_0_270, plain, (~c1_0), inference(extension_rule, [i_0_184])).
% 0.12/0.39 cnf(i_0_749, plain, (c1_2(X2,a443)), inference(extension_rule, [i_0_152])).
% 0.12/0.39 # End printing tableau
% 0.12/0.39 # SZS output end
% 0.12/0.39 # Branches closed with saturation will be marked with an "s"
% 0.12/0.39 # Child (32012) has found a proof.
% 0.12/0.39
% 0.12/0.39 # Proof search is over...
% 0.12/0.39 # Freeing feature tree
%------------------------------------------------------------------------------