TSTP Solution File: SYN535-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN535-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 : n015.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:13 EDT 2022
% Result : Satisfiable 0.21s 0.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN535-1 : TPTP v8.1.0. Released v2.1.0.
% 0.07/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.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jul 12 04:22:10 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.38 # No SInE strategy applied
% 0.13/0.38 # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_OS_S1U
% 0.13/0.38 # and selection function SelectComplexAHPExceptRRHorn.
% 0.13/0.38 #
% 0.13/0.38 # Number of axioms: 100 Number of unprocessed: 100
% 0.13/0.38 # Tableaux proof search.
% 0.13/0.38 # APR header successfully linked.
% 0.13/0.38 # Hello from C++
% 0.13/0.38 # The folding up rule is enabled...
% 0.13/0.38 # Local unification is enabled...
% 0.13/0.38 # Any saturation attempts will use folding labels...
% 0.13/0.38 # 100 beginning clauses after preprocessing and clausification
% 0.13/0.38 # Creating start rules for all 100 conjectures.
% 0.13/0.38 # There are 100 start rule candidates:
% 0.13/0.38 # Found 0 unit axioms.
% 0.13/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.38 # 100 start rule tableaux created.
% 0.13/0.38 # 100 extension rule candidate clauses
% 0.13/0.38 # 0 unit axiom clauses
% 0.13/0.38
% 0.13/0.38 # Requested 8, 32 cores available to the main process.
% 0.21/0.40 # 7256 Satisfiable branch
% 0.21/0.40 # Satisfiable branch found.
% 0.21/0.40 # There were 1 total branch saturation attempts.
% 0.21/0.40 # There were 0 of these attempts blocked.
% 0.21/0.40 # There were 0 deferred branch saturation attempts.
% 0.21/0.40 # There were 0 free duplicated saturations.
% 0.21/0.40 # There were 0 total successful branch saturations.
% 0.21/0.40 # There were 0 successful branch saturations in interreduction.
% 0.21/0.40 # There were 0 successful branch saturations on the branch.
% 0.21/0.40 # There were 0 successful branch saturations after the branch.
% 0.21/0.40 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.40 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.40 # Begin clausification derivation
% 0.21/0.40
% 0.21/0.40 # End clausification derivation
% 0.21/0.40 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.21/0.40 cnf(i_0_101, negated_conjecture, (ndr1_0|c1_0)).
% 0.21/0.40 cnf(i_0_102, negated_conjecture, (ndr1_0|c3_0)).
% 0.21/0.40 cnf(i_0_104, negated_conjecture, (ndr1_0|ssSkC8)).
% 0.21/0.40 cnf(i_0_105, negated_conjecture, (ndr1_0|ssSkC7)).
% 0.21/0.40 cnf(i_0_106, negated_conjecture, (ndr1_0|ssSkC6)).
% 0.21/0.40 cnf(i_0_107, negated_conjecture, (ndr1_0|ssSkC5)).
% 0.21/0.40 cnf(i_0_108, negated_conjecture, (ndr1_0|ssSkC4)).
% 0.21/0.40 cnf(i_0_109, negated_conjecture, (ndr1_0|ssSkC2)).
% 0.21/0.40 cnf(i_0_110, negated_conjecture, (ndr1_0|ssSkC0)).
% 0.21/0.40 cnf(i_0_103, negated_conjecture, (c1_0|c4_0)).
% 0.21/0.40 cnf(i_0_111, negated_conjecture, (ndr1_0|~c1_0)).
% 0.21/0.40 cnf(i_0_138, negated_conjecture, (~c2_0|~c5_0)).
% 0.21/0.40 cnf(i_0_112, negated_conjecture, (ndr1_0|c2_0|~ssSkC7)).
% 0.21/0.40 cnf(i_0_136, negated_conjecture, (c1_0|c3_0|~c5_0)).
% 0.21/0.40 cnf(i_0_137, negated_conjecture, (c3_0|c4_0|~c5_0)).
% 0.21/0.40 cnf(i_0_129, negated_conjecture, (ndr1_0|~c4_0|~ssSkC6)).
% 0.21/0.40 cnf(i_0_125, negated_conjecture, (ndr1_0|~ssSkC8|~c2_0)).
% 0.21/0.40 cnf(i_0_113, negated_conjecture, (ndr1_0|~ssSkC4|~ssSkC3)).
% 0.21/0.40 cnf(i_0_159, negated_conjecture, (c3_0|~c1_0|~c4_0)).
% 0.21/0.40 cnf(i_0_114, negated_conjecture, (c3_0|ndr1_1(a495))).
% 0.21/0.40 cnf(i_0_115, negated_conjecture, (c3_0|c2_1(a495))).
% 0.21/0.40 cnf(i_0_116, negated_conjecture, (ssSkC8|ndr1_1(a517))).
% 0.21/0.40 cnf(i_0_117, negated_conjecture, (ssSkC8|c4_1(a517))).
% 0.21/0.40 cnf(i_0_118, negated_conjecture, (ssSkC7|c1_1(a513))).
% 0.21/0.40 cnf(i_0_119, negated_conjecture, (ssSkC7|c3_1(a513))).
% 0.21/0.40 cnf(i_0_120, negated_conjecture, (ssSkC4|c3_1(a507))).
% 0.21/0.40 cnf(i_0_121, negated_conjecture, (ssSkC2|ndr1_1(a500))).
% 0.21/0.40 cnf(i_0_122, negated_conjecture, (ssSkC2|c3_1(a500))).
% 0.21/0.40 cnf(i_0_123, negated_conjecture, (ssSkC0|ndr1_1(a492))).
% 0.21/0.40 cnf(i_0_124, negated_conjecture, (ssSkC0|c5_1(a492))).
% 0.21/0.40 cnf(i_0_126, negated_conjecture, (c3_1(a516)|~c1_0)).
% 0.21/0.40 cnf(i_0_133, negated_conjecture, (c3_0|c4_1(a498)|~ssSkC1)).
% 0.21/0.40 cnf(i_0_127, negated_conjecture, (c2_0|ndr1_1(a514)|~ssSkC7)).
% 0.21/0.40 cnf(i_0_128, negated_conjecture, (c2_0|c1_1(a514)|~ssSkC7)).
% 0.21/0.40 cnf(i_0_154, negated_conjecture, (c4_1(a512)|~c4_0|~ssSkC6)).
% 0.21/0.40 cnf(i_0_131, negated_conjecture, (c1_1(a508)|~ssSkC4|~ssSkC3)).
% 0.21/0.40 cnf(i_0_150, negated_conjecture, (c1_1(a519)|~ssSkC8|~c2_0)).
% 0.21/0.40 cnf(i_0_155, negated_conjecture, (c1_1(a512)|~c4_0|~ssSkC6)).
% 0.21/0.40 cnf(i_0_130, negated_conjecture, (c5_1(a508)|~ssSkC4|~ssSkC3)).
% 0.21/0.40 cnf(i_0_132, negated_conjecture, (c1_0|~c4_1(a499))).
% 0.21/0.40 cnf(i_0_141, negated_conjecture, (ssSkC8|~c2_1(a517))).
% 0.21/0.40 cnf(i_0_142, negated_conjecture, (ssSkC7|~c4_1(a513))).
% 0.21/0.40 cnf(i_0_144, negated_conjecture, (ssSkC6|~c2_1(a511))).
% 0.21/0.40 cnf(i_0_143, negated_conjecture, (ssSkC6|~c3_1(a511))).
% 0.21/0.40 cnf(i_0_145, negated_conjecture, (ssSkC5|~c2_1(a509))).
% 0.21/0.40 cnf(i_0_146, negated_conjecture, (ssSkC4|~c4_1(a507))).
% 0.21/0.40 cnf(i_0_148, negated_conjecture, (ssSkC2|~c2_1(a500))).
% 0.21/0.40 cnf(i_0_149, negated_conjecture, (ssSkC0|~c2_1(a492))).
% 0.21/0.40 cnf(i_0_151, negated_conjecture, (~c1_0|~c1_1(a516))).
% 0.21/0.40 cnf(i_0_158, negated_conjecture, (c1_0|~ssSkC0|~c4_1(a494))).
% 0.21/0.40 cnf(i_0_157, negated_conjecture, (c1_0|~ssSkC0|~c3_1(a494))).
% 0.21/0.40 cnf(i_0_168, negated_conjecture, (~c4_0|~ssSkC6|~c3_1(a512))).
% 0.21/0.40 cnf(i_0_166, negated_conjecture, (~ssSkC8|~c2_0|~c2_1(a519))).
% 0.21/0.40 cnf(i_0_134, negated_conjecture, (c3_0|c4_2(a495,a496))).
% 0.21/0.40 cnf(i_0_135, negated_conjecture, (c3_0|c2_2(a495,a496))).
% 0.21/0.40 cnf(i_0_139, negated_conjecture, (ssSkC8|c3_2(a517,a518))).
% 0.21/0.40 cnf(i_0_140, negated_conjecture, (ssSkC8|c5_2(a517,a518))).
% 0.21/0.40 cnf(i_0_147, negated_conjecture, (ssSkC2|c1_2(a500,a501))).
% 0.21/0.40 cnf(i_0_169, negated_conjecture, (c5_0|c4_1(X1)|c5_1(X1)|~ndr1_0|~c3_0)).
% 0.21/0.40 cnf(i_0_153, negated_conjecture, (c2_0|c2_2(a514,a515)|~ssSkC7)).
% 0.21/0.40 cnf(i_0_152, negated_conjecture, (c2_0|c3_2(a514,a515)|~ssSkC7)).
% 0.21/0.40 cnf(i_0_170, negated_conjecture, (ssSkC3|ndr1_1(X1)|c4_1(X1)|~ndr1_0|~c5_1(X1))).
% 0.21/0.40 cnf(i_0_156, negated_conjecture, (c3_0|~c5_2(a495,a496))).
% 0.21/0.40 cnf(i_0_160, negated_conjecture, (ssSkC8|~c4_2(a517,a518))).
% 0.21/0.40 cnf(i_0_161, negated_conjecture, (ssSkC2|~c2_2(a500,a501))).
% 0.21/0.40 cnf(i_0_162, negated_conjecture, (ssSkC2|~c3_2(a500,a501))).
% 0.21/0.40 cnf(i_0_165, negated_conjecture, (ssSkC0|~c2_2(a492,a493))).
% 0.21/0.40 cnf(i_0_164, negated_conjecture, (ssSkC0|~c3_2(a492,a493))).
% 0.21/0.40 cnf(i_0_163, negated_conjecture, (ssSkC0|~c5_2(a492,a493))).
% 0.21/0.40 cnf(i_0_167, negated_conjecture, (c2_0|~ssSkC7|~c5_2(a514,a515))).
% 0.21/0.40 cnf(i_0_176, negated_conjecture, (c2_0|c2_1(X1)|ndr1_1(a503)|~ndr1_0|~c1_1(X1)|~c3_1(X1))).
% 0.21/0.40 cnf(i_0_171, negated_conjecture, (ssSkC3|c4_1(X1)|c4_2(X1,a506)|~ndr1_0|~c5_1(X1))).
% 0.21/0.40 cnf(i_0_172, negated_conjecture, (ssSkC3|c4_1(X1)|c5_2(X1,a506)|~ndr1_0|~c5_1(X1))).
% 0.21/0.40 cnf(i_0_177, negated_conjecture, (c2_0|c2_1(X1)|c4_2(a503,a504)|~ndr1_0|~c1_1(X1)|~c3_1(X1))).
% 0.21/0.40 cnf(i_0_175, negated_conjecture, (ssSkC3|c4_1(X1)|~ndr1_0|~c5_1(X1)|~c3_2(X1,a506))).
% 0.21/0.40 cnf(i_0_185, negated_conjecture, (c2_0|c2_1(X1)|~ndr1_0|~c1_1(X1)|~c3_1(X1)|~c2_2(a503,a504))).
% 0.21/0.40 cnf(i_0_184, negated_conjecture, (c2_0|c2_1(X1)|~ndr1_0|~c1_1(X1)|~c3_1(X1)|~c2_2(a503,a505))).
% 0.21/0.40 cnf(i_0_182, negated_conjecture, (c2_0|c2_1(X1)|~ndr1_0|~c1_1(X1)|~c3_1(X1)|~c3_2(a503,a505))).
% 0.21/0.40 cnf(i_0_186, negated_conjecture, (c2_0|c2_1(X1)|~ndr1_0|~c1_1(X1)|~c3_1(X1)|~c5_2(a503,a504))).
% 0.21/0.40 cnf(i_0_183, negated_conjecture, (c2_0|c2_1(X1)|~ndr1_0|~c1_1(X1)|~c3_1(X1)|~c5_2(a503,a505))).
% 0.21/0.40 cnf(i_0_173, negated_conjecture, (c3_0|c3_2(a498,X1)|~ssSkC1|~ndr1_1(a498)|~c4_2(a498,X1))).
% 0.21/0.40 cnf(i_0_174, negated_conjecture, (c3_0|~ndr1_1(a495)|~c3_2(a495,X1)|~c5_2(a495,X1))).
% 0.21/0.40 cnf(i_0_178, negated_conjecture, (ssSkC6|c4_2(a511,X1)|c2_2(a511,X1)|~ndr1_1(a511)|~c3_2(a511,X1))).
% 0.21/0.40 cnf(i_0_179, negated_conjecture, (ssSkC5|c4_2(a509,X1)|c5_2(a509,X1)|~ndr1_1(a509)|~c2_2(a509,X1))).
% 0.21/0.40 cnf(i_0_180, negated_conjecture, (c3_2(a516,X1)|c5_2(a516,X1)|~c1_0|~ndr1_1(a516)|~c4_2(a516,X1))).
% 0.21/0.40 cnf(i_0_187, negated_conjecture, (c1_0|c3_2(a494,X1)|c1_2(a494,X1)|~ssSkC0|~ndr1_1(a494)|~c4_2(a494,X1))).
% 0.21/0.40 cnf(i_0_181, negated_conjecture, (c2_0|c3_2(a514,X1)|c5_2(a514,X1)|~ssSkC7|~ndr1_1(a514)|~c4_2(a514,X1))).
% 0.21/0.40 cnf(i_0_190, negated_conjecture, (ssSkC1|c3_1(X1)|c2_2(X1,X2)|c1_2(X1,X2)|c3_2(X1,a497)|~ndr1_0|~ndr1_1(X1))).
% 0.21/0.40 cnf(i_0_188, negated_conjecture, (ssSkC1|c3_1(X1)|c2_2(X1,X2)|c1_2(X1,X2)|c5_2(X1,a497)|~ndr1_0|~ndr1_1(X1))).
% 0.21/0.40 cnf(i_0_189, negated_conjecture, (ssSkC1|c3_1(X1)|c2_2(X1,X2)|c1_2(X1,X2)|c1_2(X1,a497)|~ndr1_0|~ndr1_1(X1))).
% 0.21/0.40 cnf(i_0_191, negated_conjecture, (ssSkC4|~ndr1_1(a507)|~c2_2(a507,X1)|~c3_2(a507,X1)|~c5_2(a507,X1))).
% 0.21/0.40 cnf(i_0_196, negated_conjecture, (~ndr1_0|~c4_0|~c5_0|~ndr1_1(X1)|~c4_1(X1)|~c3_1(X1)|~c4_2(X1,X2)|~c5_2(X1,X2))).
% 0.21/0.40 cnf(i_0_192, negated_conjecture, (ndr1_1(X3)|c2_1(X3)|c3_1(X1)|~ndr1_0|~ssSkC5|~ndr1_1(X1)|~c3_1(X3)|~c4_2(X1,X2)|~c3_2(X1,X2))).
% 0.21/0.40 cnf(i_0_200, negated_conjecture, (c2_0|c2_1(X1)|c1_2(a503,X2)|~ndr1_0|~c1_1(X1)|~c3_1(X1)|~ndr1_1(a503)|~c3_2(a503,X2)|~c5_2(a503,X2))).
% 0.21/0.40 cnf(i_0_193, negated_conjecture, (c5_1(X1)|c3_2(X1,X2)|c1_2(X1,X2)|c5_2(X1,a502)|~ndr1_0|~ssSkC2|~c2_0|~ndr1_1(X1)|~c4_2(X1,X2))).
% 0.21/0.40 cnf(i_0_194, negated_conjecture, (c5_1(X1)|c3_2(X1,X2)|c1_2(X1,X2)|~ndr1_0|~ssSkC2|~c2_0|~ndr1_1(X1)|~c4_2(X1,X2)|~c2_2(X1,a502))).
% 0.21/0.40 cnf(i_0_195, negated_conjecture, (c5_1(X1)|c3_2(X1,X2)|c1_2(X1,X2)|~ndr1_0|~ssSkC2|~c2_0|~ndr1_1(X1)|~c4_2(X1,X2)|~c3_2(X1,a502))).
% 0.21/0.40 cnf(i_0_199, negated_conjecture, (c5_1(X3)|c5_2(X1,X2)|~ndr1_0|~c2_0|~ndr1_1(X1)|~c4_1(X1)|~c1_1(X1)|~c3_2(X1,X2)|~c1_2(X1,X2))).
% 0.21/0.40 cnf(i_0_197, negated_conjecture, (c2_1(X3)|c3_1(X1)|~ndr1_0|~ssSkC5|~ndr1_1(X1)|~c3_1(X3)|~c4_2(X1,X2)|~c3_2(X1,X2)|~c2_2(X3,a510))).
% 0.21/0.40 cnf(i_0_198, negated_conjecture, (c2_1(X3)|c3_1(X1)|~ndr1_0|~ssSkC5|~ndr1_1(X1)|~c3_1(X3)|~c4_2(X1,X2)|~c3_2(X1,X2)|~c3_2(X3,a510))).
% 0.21/0.40 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.21/0.40 # Begin printing tableau
% 0.21/0.40 # Found 3 steps
% 0.21/0.40 cnf(i_0_117, negated_conjecture, (ssSkC8|c4_1(a517)), inference(start_rule)).
% 0.21/0.40 cnf(i_0_515, plain, (ssSkC8), inference(extension_rule, [i_0_166])).
% 0.21/0.40 cnf(i_0_3031, plain, (~c2_0), inference(extension_rule, [i_0_200])).
% 0.21/0.40 # End printing tableau
% 0.21/0.40 # SZS output end
% 0.21/0.40 # Branches closed with saturation will be marked with an "s"
% 0.21/0.40 # Child (7256) has found a proof.
% 0.21/0.40
% 0.21/0.40 # Proof search is over...
% 0.21/0.40 # Freeing feature tree
%------------------------------------------------------------------------------