TSTP Solution File: SYN524-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN524-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 : n003.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:04 EDT 2022
% Result : Satisfiable 0.15s 0.36s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SYN524-1 : TPTP v8.1.0. Released v2.1.0.
% 0.02/0.11 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.11/0.30 % Computer : n003.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Tue Jul 12 00:31:15 EDT 2022
% 0.11/0.30 % CPUTime :
% 0.15/0.33 # No SInE strategy applied
% 0.15/0.33 # Auto-Mode selected heuristic G_N___023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y
% 0.15/0.33 # and selection function SelectMaxLComplexAvoidPosPred.
% 0.15/0.33 #
% 0.15/0.33 # Number of axioms: 101 Number of unprocessed: 101
% 0.15/0.33 # Tableaux proof search.
% 0.15/0.33 # APR header successfully linked.
% 0.15/0.33 # Hello from C++
% 0.15/0.34 # The folding up rule is enabled...
% 0.15/0.34 # Local unification is enabled...
% 0.15/0.34 # Any saturation attempts will use folding labels...
% 0.15/0.34 # 101 beginning clauses after preprocessing and clausification
% 0.15/0.34 # Creating start rules for all 101 conjectures.
% 0.15/0.34 # There are 101 start rule candidates:
% 0.15/0.34 # Found 0 unit axioms.
% 0.15/0.34 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.15/0.34 # 101 start rule tableaux created.
% 0.15/0.34 # 101 extension rule candidate clauses
% 0.15/0.34 # 0 unit axiom clauses
% 0.15/0.34
% 0.15/0.34 # Requested 8, 32 cores available to the main process.
% 0.15/0.36 # 935 Satisfiable branch
% 0.15/0.36 # Satisfiable branch found.
% 0.15/0.36 # There were 1 total branch saturation attempts.
% 0.15/0.36 # There were 0 of these attempts blocked.
% 0.15/0.36 # There were 0 deferred branch saturation attempts.
% 0.15/0.36 # There were 0 free duplicated saturations.
% 0.15/0.36 # There were 0 total successful branch saturations.
% 0.15/0.36 # There were 0 successful branch saturations in interreduction.
% 0.15/0.36 # There were 0 successful branch saturations on the branch.
% 0.15/0.36 # There were 0 successful branch saturations after the branch.
% 0.15/0.36 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.36 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.36 # Begin clausification derivation
% 0.15/0.36
% 0.15/0.36 # End clausification derivation
% 0.15/0.36 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.15/0.36 cnf(i_0_102, negated_conjecture, (ndr1_0|ssSkC3)).
% 0.15/0.36 cnf(i_0_103, negated_conjecture, (ndr1_0|ssSkC2)).
% 0.15/0.36 cnf(i_0_104, negated_conjecture, (ndr1_0|ssSkC1)).
% 0.15/0.36 cnf(i_0_109, negated_conjecture, (ndr1_0|~c5_0)).
% 0.15/0.36 cnf(i_0_107, negated_conjecture, (ndr1_0|~c3_0)).
% 0.15/0.36 cnf(i_0_105, negated_conjecture, (ndr1_0|c1_0|c5_0)).
% 0.15/0.36 cnf(i_0_106, negated_conjecture, (ndr1_0|c4_0|c2_0)).
% 0.15/0.36 cnf(i_0_110, negated_conjecture, (ndr1_0|c1_0|~ssSkC0)).
% 0.15/0.36 cnf(i_0_127, negated_conjecture, (c2_0|c3_0|~c4_0)).
% 0.15/0.36 cnf(i_0_108, negated_conjecture, (ndr1_0|~ssSkC3|~ssSkC2)).
% 0.15/0.36 cnf(i_0_121, negated_conjecture, (ndr1_0|~c4_0|~ssSkC4)).
% 0.15/0.36 cnf(i_0_113, negated_conjecture, (ssSkC2|c3_1(a169))).
% 0.15/0.36 cnf(i_0_114, negated_conjecture, (ssSkC1|ndr1_1(a161))).
% 0.15/0.36 cnf(i_0_115, negated_conjecture, (ssSkC1|c4_1(a161))).
% 0.15/0.36 cnf(i_0_123, negated_conjecture, (ndr1_1(a165)|~c5_0)).
% 0.15/0.36 cnf(i_0_120, negated_conjecture, (c3_1(a180)|~c3_0)).
% 0.15/0.36 cnf(i_0_119, negated_conjecture, (c2_1(a180)|~c3_0)).
% 0.15/0.36 cnf(i_0_124, negated_conjecture, (c1_1(a165)|~c5_0)).
% 0.15/0.36 cnf(i_0_116, negated_conjecture, (c1_0|c5_0|ndr1_1(a183))).
% 0.15/0.36 cnf(i_0_117, negated_conjecture, (c1_0|c5_0|c2_1(a183))).
% 0.15/0.36 cnf(i_0_118, negated_conjecture, (c4_0|c2_0|c1_1(a181))).
% 0.15/0.36 cnf(i_0_125, negated_conjecture, (c1_0|c3_1(a158)|~ssSkC0)).
% 0.15/0.36 cnf(i_0_126, negated_conjecture, (c1_0|c5_1(a158)|~ssSkC0)).
% 0.15/0.36 cnf(i_0_122, negated_conjecture, (ndr1_1(a171)|~ssSkC3|~ssSkC2)).
% 0.15/0.36 cnf(i_0_147, negated_conjecture, (ndr1_1(a178)|~c2_0|~c3_0)).
% 0.15/0.36 cnf(i_0_148, negated_conjecture, (c4_1(a178)|~c2_0|~c3_0)).
% 0.15/0.36 cnf(i_0_138, negated_conjecture, (c2_1(a175)|~c4_0|~ssSkC4)).
% 0.15/0.36 cnf(i_0_137, negated_conjecture, (c1_1(a175)|~c4_0|~ssSkC4)).
% 0.15/0.36 cnf(i_0_130, negated_conjecture, (ssSkC3|~c3_1(a170))).
% 0.15/0.36 cnf(i_0_129, negated_conjecture, (ssSkC3|~c1_1(a170))).
% 0.15/0.36 cnf(i_0_134, negated_conjecture, (ssSkC1|~c3_1(a161))).
% 0.15/0.36 cnf(i_0_136, negated_conjecture, (c4_0|c2_0|~c4_1(a181))).
% 0.15/0.36 cnf(i_0_140, negated_conjecture, (~ssSkC3|~ssSkC2|~c4_1(a171))).
% 0.15/0.36 cnf(i_0_111, negated_conjecture, (ndr1_1(X1)|ssSkP1(X1))).
% 0.15/0.36 cnf(i_0_112, negated_conjecture, (ndr1_1(X1)|ssSkP0(X1))).
% 0.15/0.36 cnf(i_0_131, negated_conjecture, (ssSkC1|c3_2(a161,a162))).
% 0.15/0.36 cnf(i_0_132, negated_conjecture, (ssSkC1|c5_2(a161,a162))).
% 0.15/0.36 cnf(i_0_133, negated_conjecture, (ssSkC1|c1_2(a161,a162))).
% 0.15/0.36 cnf(i_0_142, negated_conjecture, (c3_2(a165,a166)|~c5_0)).
% 0.15/0.36 cnf(i_0_141, negated_conjecture, (c1_2(a165,a166)|~c5_0)).
% 0.15/0.36 cnf(i_0_135, negated_conjecture, (c1_0|c5_0|c1_2(a183,a184))).
% 0.15/0.36 cnf(i_0_139, negated_conjecture, (c3_2(a171,a172)|~ssSkC3|~ssSkC2)).
% 0.15/0.36 cnf(i_0_151, negated_conjecture, (c5_2(a178,a179)|~c2_0|~c3_0)).
% 0.15/0.36 cnf(i_0_154, negated_conjecture, (c5_0|ndr1_1(X1)|~ndr1_0|~c1_0|~c2_1(X1))).
% 0.15/0.36 cnf(i_0_128, negated_conjecture, (ssSkP0(X1)|c2_2(X1,a176))).
% 0.15/0.36 cnf(i_0_155, negated_conjecture, (ssSkC4|ndr1_1(X1)|c1_1(X1)|~ndr1_0|~c3_1(X1))).
% 0.15/0.36 cnf(i_0_150, negated_conjecture, (~c5_0|~c5_2(a165,a166))).
% 0.15/0.36 cnf(i_0_146, negated_conjecture, (c1_0|c5_0|~c5_2(a183,a184))).
% 0.15/0.36 cnf(i_0_149, negated_conjecture, (~ssSkC3|~ssSkC2|~c1_2(a171,a172))).
% 0.15/0.36 cnf(i_0_152, negated_conjecture, (~c2_0|~c3_0|~c4_2(a178,a179))).
% 0.15/0.36 cnf(i_0_153, negated_conjecture, (c3_0|ndr1_1(X1)|~ndr1_0|~ssSkP1(X1)|~c3_1(X1))).
% 0.15/0.36 cnf(i_0_158, negated_conjecture, (c5_0|c2_2(X1,a187)|~ndr1_0|~c1_0|~c2_1(X1))).
% 0.15/0.36 cnf(i_0_157, negated_conjecture, (c5_0|c1_2(X1,a187)|~ndr1_0|~c1_0|~c2_1(X1))).
% 0.15/0.36 cnf(i_0_168, negated_conjecture, (c1_1(X1)|ndr1_1(a167)|~ndr1_0|~c2_0|~c2_1(X1)|~c5_1(X1))).
% 0.15/0.36 cnf(i_0_143, negated_conjecture, (ssSkP1(X1)|~c2_2(X1,a185))).
% 0.15/0.36 cnf(i_0_144, negated_conjecture, (ssSkP1(X1)|~c3_2(X1,a185))).
% 0.15/0.36 cnf(i_0_145, negated_conjecture, (ssSkP0(X1)|~c4_2(X1,a176))).
% 0.15/0.36 cnf(i_0_175, negated_conjecture, (~ndr1_0|~c2_0|~c3_0|~c3_1(X1)|~c4_1(X1)|~c5_1(X1))).
% 0.15/0.36 cnf(i_0_156, negated_conjecture, (c3_0|c4_2(X1,a186)|~ndr1_0|~ssSkP1(X1)|~c3_1(X1))).
% 0.15/0.36 cnf(i_0_161, negated_conjecture, (c5_0|~ndr1_0|~c1_0|~c2_1(X1)|~c5_2(X1,a187))).
% 0.15/0.36 cnf(i_0_159, negated_conjecture, (c1_0|c5_0|c2_2(a183,X1)|c3_# 936 Satisfiable branch
% 0.15/0.36 2(a183,X1)|~ndr1_1(a183))).
% 0.15/0.36 cnf(i_0_171, negated_conjecture, (c1_1(X1)|c2_2(a167,a168)|~ndr1_0|~c2_0|~c2_1(X1)|~c5_1(X1))).
% 0.15/0.36 cnf(i_0_172, negated_conjecture, (c1_1(X1)|c3_2(a167,a168)|~ndr1_0|~c2_0|~c2_1(X1)|~c5_1(X1))).
% 0.15/0.36 cnf(i_0_173, negated_conjecture, (c1_1(X1)|c4_2(a167,a168)|~ndr1_0|~c2_0|~c2_1(X1)|~c5_1(X1))).
% 0.15/0.36 cnf(i_0_165, negated_conjecture, (c3_2(a178,X1)|c4_2(a178,X1)|~c2_0|~c3_0|~ndr1_1(a178))).
% 0.15/0.36 cnf(i_0_162, negated_conjecture, (ssSkC4|c1_1(X1)|~ndr1_0|~c3_1(X1)|~c2_2(X1,a174))).
% 0.15/0.36 cnf(i_0_163, negated_conjecture, (ssSkC4|c1_1(X1)|~ndr1_0|~c3_1(X1)|~c5_2(X1,a174))).
% 0.15/0.36 cnf(i_0_164, negated_conjecture, (ssSkC4|c1_1(X1)|~ndr1_0|~c3_1(X1)|~c1_2(X1,a174))).
% 0.15/0.36 cnf(i_0_160, negated_conjecture, (c3_0|~ndr1_0|~ssSkP1(X1)|~c3_1(X1)|~c1_2(X1,a186))).
% 0.15/0.36 cnf(i_0_178, negated_conjecture, (c3_0|ndr1_1(X1)|c4_1(X2)|~ndr1_0|~ssSkP0(X1)|~c2_1(X2)|~c1_1(X1)|~c5_1(X2))).
% 0.15/0.36 cnf(i_0_167, negated_conjecture, (ssSkC2|c2_2(a169,X1)|c3_2(a169,X1)|c5_2(a169,X1)|~ndr1_1(a169))).
% 0.15/0.36 cnf(i_0_169, negated_conjecture, (c1_0|c5_2(a158,X1)|c1_2(a158,X1)|c4_2(a158,X1)|~ssSkC0|~ndr1_1(a158))).
% 0.15/0.36 cnf(i_0_166, negated_conjecture, (~ssSkC3|~ssSkC2|~ndr1_1(a171)|~c5_2(a171,X1)|~c4_2(a171,X1))).
% 0.15/0.36 cnf(i_0_180, negated_conjecture, (c3_0|c4_1(X2)|c2_2(X1,a177)|~ndr1_0|~ssSkP0(X1)|~c2_1(X2)|~c1_1(X1)|~c5_1(X2))).
% 0.15/0.36 cnf(i_0_182, negated_conjecture, (c3_0|c4_1(X2)|c3_2(X1,a177)|~ndr1_0|~ssSkP0(X1)|~c2_1(X2)|~c1_1(X1)|~c5_1(X2))).
% 0.15/0.36 cnf(i_0_181, negated_conjecture, (c3_0|c4_1(X2)|c4_2(X1,a177)|~ndr1_0|~ssSkP0(X1)|~c2_1(X2)|~c1_1(X1)|~c5_1(X2))).
% 0.15/0.36 cnf(i_0_174, negated_conjecture, (c5_2(a165,X1)|c4_2(a165,X1)|~c5_0|~ndr1_1(a165)|~c3_2(a165,X1))).
% 0.15/0.36 cnf(i_0_170, negated_conjecture, (c4_0|c2_0|c3_2(a181,X1)|c5_2(a181,X1)|~ndr1_1(a181)|~c1_2(a181,X1))).
% 0.15/0.36 cnf(i_0_177, negated_conjecture, (c2_2(a175,X1)|c4_2(a175,X1)|~c4_0|~ssSkC4|~ndr1_1(a175)|~c3_2(a175,X1))).
% 0.15/0.36 cnf(i_0_179, negated_conjecture, (ssSkC0|c5_2(X1,X2)|c1_2(X1,X2)|c2_2(X1,a157)|~ndr1_0|~ndr1_1(X1)|~c5_1(X1))).
% 0.15/0.36 cnf(i_0_186, negated_conjecture, (c3_1(X1)|c1_1(X1)|ndr1_1(a159)|c2_2(X1,X2)|~ndr1_0|~c1_0|~ndr1_1(X1)|~c5_2(X1,X2))).
% 0.15/0.36 cnf(i_0_176, negated_conjecture, (c4_2(a180,X1)|~c3_0|~ndr1_1(a180)|~c5_2(a180,X1)|~c1_2(a180,X1))).
% 0.15/0.36 cnf(i_0_190, negated_conjecture, (c3_1(X1)|c1_1(X1)|c2_2(X1,X2)|~ndr1_0|~c1_0|~ndr1_1(X1)|~c3_1(a159)|~c5_2(X1,X2))).
% 0.15/0.36 cnf(i_0_189, negated_conjecture, (c3_1(X1)|c1_1(X1)|c2_2(X1,X2)|~ndr1_0|~c1_0|~ndr1_1(X1)|~c2_1(a159)|~c5_2(X1,X2))).
% 0.15/0.36 cnf(i_0_183, negated_conjecture, (ssSkC0|c5_2(X1,X2)|c1_2(X1,X2)|~ndr1_0|~ndr1_1(X1)|~c5_1(X1)|~c3_2(X1,a157))).
% 0.15/0.36 cnf(i_0_196, negated_conjecture, (c1_1(X1)|~ndr1_0|~c2_0|~c2_1(X1)|~c5_1(X1)|~ndr1_1(a167)|~c3_2(a167,X2)|~c1_2(a167,X2))).
% 0.15/0.36 cnf(i_0_184, negated_conjecture, (c2_1(X1)|c1_1(X1)|ndr1_1(a163)|~ndr1_0|~ssSkC1|~ndr1_1(X1)|~c1_2(X1,X2)|~c4_2(X1,X2))).
% 0.15/0.36 cnf(i_0_185, negated_conjecture, (c2_1(X1)|c1_1(X1)|c3_1(a163)|~ndr1_0|~ssSkC1|~ndr1_1(X1)|~c1_2(X1,X2)|~c4_2(X1,X2))).
% 0.15/0.36 cnf(i_0_188, negated_conjecture, (c2_1(X1)|c1_1(X1)|~ndr1_0|~ssSkC1|~ndr1_1(X1)|~c2_1(a163)|~c1_2(X1,X2)|~c4_2(X1,X2))).
% 0.15/0.36 cnf(i_0_195, negated_conjecture, (ndr1_1(X3)|c2_2(X1,X2)|c5_2(X1,X2)|c4_2(X1,X2)|~ndr1_0|~c5_0|~ndr1_1(X1)|~c2_1(X1)|~c5_1(X1))).
% 0.15/0.36 cnf(i_0_193, negated_conjecture, (c3_1(X1)|c1_1(X1)|c2_2(X1,X2)|~ndr1_0|~c1_0|~ndr1_1(X1)|~c5_2(X1,X2)|~c3_2(a159,a160))).
% 0.15/0.36 cnf(i_0_194, negated_conjecture, (c3_1(X1)|c1_1(X1)|c2_2(X1,X2)|~ndr1_0|~c1_0|~ndr1_1(X1)|~c5_2(X1,X2)|~c5_2(a159,a160))).
% 0.15/0.36 cnf(i_0_187, negated_conjecture, (c2_1(X1)|c1_1(X1)|c5_2(a163,a164)|~ndr1_0|~ssSkC1|~ndr1_1(X1)|~c1_2(X1,X2)|~c4_2(X1,X2))).
% 0.15/0.36 cnf(i_0_199, negated_conjecture, (c1_1(X1)|c4_2(a167,X2)|~ndr1_0|~c2_0|~c2_1(X1)|~c5_1(X1)|~ndr1_1(a167)|~c2_2(a167,X2)|~c1_2(a167,X2))).
% 0.15/0.36 cnf(i_0_192, negated_conjecture, (c2_1(X1)|c1_1(X1)|~ndr1_0|~ssSkC1|~ndr1_1(X1)|~c1_2(X1,X2)|~c4_2(X1,X2)|~c3_2(a163,a164))).
% 0.15/0.36 cnf(i_0_191, negated_conjecture, (c2_1(X1)|c1_1(X1)|~ndr1_0|~ssSkC1|~ndr1_1(X1)|~c1_2(X1,X2)|~c4_2(X1,X2)|~c1_2(a163,a164))).
% 0.15/0.36 cnf(i_0_198, negated_conjecture, (c2_2(X1,X3)|c5_2(X1,X3)|c4_2(X1,X3)|~ndr1_0|~c5_0|~ndr1_1(X1)|~c2_1(X1)|~c5_1(X1)|~c3_2(X2,a173))).
% 0.15/0.36 cnf(i_0_197, negated_conjecture, (c2_2(X1,X3)|c5_2(X1,X3)|c4_2(X1,X3)|~ndr1_0|~c5_0|~ndr1_1(X1)|~c2_1(X1)|~c5_1(X1)|~c5_2(X2,a173))).
% 0.15/0.36 cnf(i_0_200, negated_conjecture, (c3_0|c1_1(X3)|c2_2(X3,X4)|c1_2(X3,X4)|c5_2(X3,a182)|~ndr1_0|~ndr1_1(X3)|~ndr1_1(X1)|~c4_1(X1)|~c1_1(X1)|~c3_2(X3,X4)|~c3_2(X1,X2)|~c1_2(X1,X2)|~c4_2(X1,X2))).
% 0.15/0.36 cnf(i_0_202, negated_conjecture, (c3_0|c1_1(X3)|c2_2(X3,X4)|c1_2(X3,X4)|~ndr1_0|~ndr1_1(X3)|~ndr1_1(X1)|~c4_1(X1)|~c1_1(X1)|~c3_2(X3,X4)|~c3_2(X1,X2)|~c1_2(X1,X2)|~c4_2(X1,X2)|~c2_2(X3,a182))).
% 0.15/0.36 cnf(i_0_201, negated_conjecture, (c3_0|c1_1(X3)|c2_2(X3,X4)|c1_2(X3,X4)|~ndr1_0|~ndr1_1(X3)|~ndr1_1(X1)|~c4_1(X1)|~c1_1(X1)|~c3_2(X3,X4)|~c3_2(X1,X2)|~c1_2(X1,X2)|~c4_2(X1,X2)|~c3_2(X3,a182))).
% 0.15/0.36 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.15/0.36 # Begin printing tableau
% 0.15/0.36 # Found 3 steps
% 0.15/0.36 cnf(i_0_120, negated_conjecture, (c3_1(a180)|~c3_0), inference(start_rule)).
% 0.15/0.36 cnf(i_0_644, plain, (c3_1(a180)), inference(extension_rule, [i_0_164])).
% 0.15/0.36 cnf(i_0_1903, plain, (ssSkC4), inference(extension_rule, [i_0_177])).
% 0.15/0.36 # End printing tableau
% 0.15/0.36 # SZS output end
% 0.15/0.36 # Branches closed with saturation will be marked with an "s"
% 0.15/0.36 # Satisfiable branch found.
% 0.15/0.36 # There were 1 total branch saturation attempts.
% 0.15/0.36 # There were 0 of these attempts blocked.
% 0.15/0.36 # There were 0 deferred branch saturation attempts.
% 0.15/0.36 # There were 0 free duplicated saturations.
% 0.15/0.36 # There were 0 total successful branch saturations.
% 0.15/0.36 # There were 0 successful branch saturations in interreduction.
% 0.15/0.36 # There were 0 successful branch saturations on the branch.
% 0.15/0.36 # There were 0 successful branch saturations after the branch.
% 0.15/0.36 # Child (935) has found a proof.
% 0.15/0.36
% 0.15/0.36 # Proof search is over...
% 0.15/0.36 # Freeing feature tree
%------------------------------------------------------------------------------