TSTP Solution File: SYN517-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : SYN517-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 : n019.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:11:59 EDT 2022
% Result : Satisfiable 0.20s 0.38s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN517-1 : TPTP v8.1.0. Released v2.1.0.
% 0.03/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 : n019.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 : Mon Jul 11 22:17:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.37 # No SInE strategy applied
% 0.20/0.37 # Auto-Mode selected heuristic H_____011_C07_F1_PI_AE_OS_S1U
% 0.20/0.37 # and selection function SelectComplexAHPExceptRRHorn.
% 0.20/0.37 #
% 0.20/0.37 # Number of axioms: 68 Number of unprocessed: 68
% 0.20/0.37 # Tableaux proof search.
% 0.20/0.37 # APR header successfully linked.
% 0.20/0.37 # Hello from C++
% 0.20/0.37 # The folding up rule is enabled...
% 0.20/0.37 # Local unification is enabled...
% 0.20/0.37 # Any saturation attempts will use folding labels...
% 0.20/0.37 # 68 beginning clauses after preprocessing and clausification
% 0.20/0.37 # Creating start rules for all 68 conjectures.
% 0.20/0.37 # There are 68 start rule candidates:
% 0.20/0.37 # Found 0 unit axioms.
% 0.20/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.20/0.37 # 68 start rule tableaux created.
% 0.20/0.37 # 68 extension rule candidate clauses
% 0.20/0.37 # 0 unit axiom clauses
% 0.20/0.37
% 0.20/0.37 # Requested 8, 32 cores available to the main process.
% 0.20/0.38 # 2773 Satisfiable branch
% 0.20/0.38 # Satisfiable branch found.
% 0.20/0.38 # There were 1 total branch saturation attempts.
% 0.20/0.38 # There were 0 of these attempts blocked.
% 0.20/0.38 # There were 0 deferred branch saturation attempts.
% 0.20/0.38 # There were 0 free duplicated saturations.
% 0.20/0.38 # There were 0 total successful branch saturations.
% 0.20/0.38 # There were 0 successful branch saturations in interreduction.
% 0.20/0.38 # There were 0 successful branch saturations on the branch.
% 0.20/0.38 # There were 0 successful branch saturations after the branch.
% 0.20/0.38 # SZS status Satisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.38 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.38 # Begin clausification derivation
% 0.20/0.38
% 0.20/0.38 # End clausification derivation
% 0.20/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.20/0.38 cnf(i_0_69, negated_conjecture, (ndr1_0|c2_0)).
% 0.20/0.38 cnf(i_0_71, negated_conjecture, (ndr1_0|ssSkC2)).
% 0.20/0.38 cnf(i_0_72, negated_conjecture, (ndr1_0|ssSkC1)).
% 0.20/0.38 cnf(i_0_73, negated_conjecture, (ndr1_0|ssSkC0)).
% 0.20/0.38 cnf(i_0_70, negated_conjecture, (c4_0|c5_0)).
% 0.20/0.38 cnf(i_0_74, negated_conjecture, (ndr1_0|c3_0|~ssSkC2)).
% 0.20/0.38 cnf(i_0_76, negated_conjecture, (ndr1_0|c3_0|~ssSkC0)).
% 0.20/0.38 cnf(i_0_98, negated_conjecture, (ndr1_0|~c2_0|~c4_0)).
% 0.20/0.38 cnf(i_0_82, negated_conjecture, (ndr1_0|~c5_0|~ssSkC1)).
% 0.20/0.38 cnf(i_0_96, negated_conjecture, (ndr1_0|~c5_0|~c3_0)).
% 0.20/0.38 cnf(i_0_101, negated_conjecture, (c5_0|~c2_0|~c3_0)).
% 0.20/0.38 cnf(i_0_75, negated_conjecture, (c2_0|ndr1_1(a65))).
% 0.20/0.38 cnf(i_0_77, negated_conjecture, (ssSkC1|ndr1_1(a62))).
% 0.20/0.38 cnf(i_0_78, negated_conjecture, (ssSkC1|c1_1(a62))).
% 0.20/0.38 cnf(i_0_79, negated_conjecture, (ssSkC0|ndr1_1(a57))).
% 0.20/0.38 cnf(i_0_85, negated_conjecture, (c2_0|c1_0|ndr1_1(a53))).
% 0.20/0.38 cnf(i_0_87, negated_conjecture, (c2_0|c1_0|c1_1(a53))).
% 0.20/0.38 cnf(i_0_86, negated_conjecture, (c2_0|c1_0|c5_1(a53))).
% 0.20/0.38 cnf(i_0_83, negated_conjecture, (c3_0|c2_1(a59)|~ssSkC0)).
% 0.20/0.38 cnf(i_0_84, negated_conjecture, (c3_0|c5_1(a59)|~ssSkC0)).
% 0.20/0.38 cnf(i_0_106, negated_conjecture, (ndr1_1(a60)|~c5_0|~c3_0)).
% 0.20/0.38 cnf(i_0_108, negated_conjecture, (ndr1_1(a55)|~c2_0|~c4_0)).
% 0.20/0.38 cnf(i_0_95, negated_conjecture, (c2_1(a64)|~c5_0|~ssSkC1)).
% 0.20/0.38 cnf(i_0_107, negated_conjecture, (c5_1(a60)|~c5_0|~c3_0)).
% 0.20/0.38 cnf(i_0_109, negated_conjecture, (c5_1(a55)|~c2_0|~c4_0)).
% 0.20/0.38 cnf(i_0_88, negated_conjecture, (ssSkC2|~c1_1(a67))).
% 0.20/0.38 cnf(i_0_92, negated_conjecture, (ssSkC0|~c5_1(a57))).
% 0.20/0.38 cnf(i_0_93, negated_conjecture, (c3_0|~ssSkC2|~c3_1(a68))).
% 0.20/0.38 cnf(i_0_97, negated_conjecture, (c3_0|~ssSkC0|~c4_1(a59))).
% 0.20/0.38 cnf(i_0_105, negated_conjecture, (~c5_0|~ssSkC1|~c5_1(a64))).
% 0.20/0.38 cnf(i_0_80, negated_conjecture, (c2_0|c5_2(a65,a66))).
% 0.20/0.38 cnf(i_0_81, negated_conjecture, (c2_0|c4_2(a65,a66))).
% 0.20/0.38 cnf(i_0_89, negated_conjecture, (ssSkC1|c3_2(a62,a63))).
% 0.20/0.38 cnf(i_0_90, negated_conjecture, (ssSkC0|c4_2(a57,a58))).
% 0.20/0.38 cnf(i_0_91, negated_conjecture, (ssSkC0|c2_2(a57,a58))).
% 0.20/0.38 cnf(i_0_99, negated_conjecture, (c2_0|c1_0|c3_2(a53,a54))).
% 0.20/0.38 cnf(i_0_100, negated_conjecture, (c2_0|c1_0|c2_2(a53,a54))).
% 0.20/0.38 cnf(i_0_111, negated_conjecture, (c4_2(a55,a56)|~c2_0|~c4_0)).
% 0.20/0.38 cnf(i_0_112, negated_conjecture, (c1_2(a55,a56)|~c2_0|~c4_0)).
% 0.20/0.38 cnf(i_0_94, negated_conjecture, (c2_0|~c3_2(a65,a66))).
% 0.20/0.38 cnf(i_0_102, negated_conjecture, (ssSkC1|~c5_2(a62,a63))).
% 0.20/0.38 cnf(i_0_103, negated_conjecture, (ssSkC1|~c2_2(a62,a63))).
% 0.20/0.38 cnf(i_0_104, negated_conjecture, (ssSkC0|~c1_2(a57,a58))).
% 0.20/0.38 cnf(i_0_110, negated_conjecture, (c2_0|c1_0|~c1_2(a53,a54))).
% 0.20/0.38 cnf(i_0_116, negated_conjecture, (~c2_0|~c4_0|~c3_2(a55,a56))).
% 0.20/0.38 cnf(i_0_115, negated_conjecture, (~c5_0|~c3_0|~c5_2(a60,a61))).
% 0.20/0.38 cnf(i_0_113, negated_conjecture, (~c5_0|~c3_0|~c4_2(a60,a61))).
% 0.20/0.38 cnf(i_0_114, negated_conjecture, (~c5_0|~c3_0|~c1_2(a60,a61))).
% 0.20/0.38 cnf(i_0_118, negated_conjecture, (c5_2(a60,X1)|c4_2(a60,X1)|~c5_0|~c3_0|~ndr1_1(a60))).
% 0.20/0.38 cnf(i_0_123, negated_conjecture, (c5_2(a55,X1)|c3_2(a55,X1)|c1_2(a55,X1)|~c2_0|~c4_0|~ndr1_1(a55))).
% 0.20/0.38 cnf(i_0_117, negated_conjecture, (c2_0|~ndr1_1(a65)|~c3_2(a65,X1)|~c1_2(a65,X1))).
% 0.20/0.38 cnf(i_0_119, negated_conjecture, (ssSkC1|c2_2(a62,X1)|c1_2(a62,X1)|~ndr1_1(a62)|~c5_2(a62,X1))).
% 0.20/0.38 cnf(i_0_120, negated_conjecture, (ssSkC0|c5_2(a57,X1)|c2_2(a57,X1)|~ndr1_1(a57)|~c3_2(a57,X1))).
% 0.20/0.38 cnf(i_0_124, negated_conjecture, (c1_0|c5_1(X1)|c3_1(X1)|ndr1_1(a50)|c4_2(X1,X2)|~ndr1_0|~ndr1_1(X1)|~c3_2(X1,X2))).
% 0.20/0.38 cnf(i_0_125, negated_conjecture, (c1_0|c5_1(X1)|c3_1(X1)|c3_1(a50)|c4_2(X1,X2)|~ndr1_0|~ndr1_1(X1)|~c3_2(X1,X2))).
% 0.20/0.38 cnf(i_0_121, negated_conjecture, (ssSkC2|c1_2(a67,X1)|~ndr1_1(a67)|~c3_2(a67,X1)|~c2_2(a67,X1))).
% 0.20/0.38 cnf(i_0_122, negated_conjecture, (c3_0|c3_2(a68,X1)|~ssSkC2|~ndr1_1(a68)|~c5_2(a68,X1)|~c4_2(a68,X1))).
% 0.20/0.38 cnf(i_0_126, negated_conjecture, (c1_0|c5_1(X1)|c3_1(X1)|c4_2(X1,X2)|c3_2(a50,a51)|~ndr1_0|~ndr1_1(X1)|~c3_2(X1,X2))).
% 0.20/0.38 cnf(i_0_128, negated_conjecture, (c1_0|c5_1(X1)|c3_1(X1)|c4_2(X1,X2)|~ndr1_0|~ndr1_1(X1)|~c3_2(X1,X2)|~c4_2(a50,a51))).
% 0.20/0.38 cnf(i_0_127, negated_conjecture, (c1_0|c5_1(X1)|c3_1(X1)|c4_2(X1,X2)|~ndr1_0|~ndr1_1(X1)|~c3_2(X1,X2)|~c1_2(a50,a51))).
% 0.20/0.38 cnf(i_0_129, negated_conjecture, (c4_0|ndr1_1(X3)|c3_1(X3)|c3_1(X1)|c4_1(X3)|c4_2(X1,X2)|c3_2(X1,X2)|c2_2(X1,X2)|~ndr1_0|~ndr1_1(X1)|~c5_1(X1))).
% 0.20/0.38 cnf(i_0_131, negated_conjecture, (c4_0|c3_1(X3)|c3_1(X1)|c4_1(X3)|c4_2(X1,X2)|c3_2(X1,X2)|c2_2(X1,X2)|c5_2(X3,a69)|~ndr1_0|~ndr1_1(X1)|~c5_1(X1))).
% 0.20/0.38 cnf(i_0_132, negated_conjecture, (c4_0|c3_1(X3)|c3_1(X1)|c4_1(X3)|c4_2(X1,X2)|c3_2(X1,X2)|c2_2(X1,X2)|c4_2(X3,a69)|~ndr1_0|~ndr1_1(X1)|~c5_1(X1))).
% 0.20/0.38 cnf(i_0_130, negated_conjecture, (c4_1(X1)|c3_2(X1,X2)|c1_2(X1,a52)|~ndr1_0|~c5_0|~c1_0|~ndr1_1(X1)|~c4_2(X1,X2)|~c2_2(X1,X2))).
% 0.20/0.38 cnf(i_0_135, negated_conjecture, (c4_0|c3_1(X2)|c3_1(X1)|c4_1(X2)|c4_2(X1,X3)|c3_2(X1,X3)|c2_2(X1,X3)|~ndr1_0|~ndr1_1(X1)|~c5_1(X1)|~c1_2(X2,a69))).
% 0.20/0.38 cnf(i_0_133, negated_conjecture, (c4_1(X1)|c3_2(X1,X2)|~ndr1_0|~c5_0|~c1_0|~ndr1_1(X1)|~c4_2(X1,X2)|~c2_2(X1,X2)|~c3_2(X1,a52))).
% 0.20/0.38 cnf(i_0_134, negated_conjecture, (c4_1(X1)|c3_2(X1,X2)|~ndr1_0|~c5_0|~c1_0|~ndr1_1(X1)|~c4_2(X1,X2)|~c2_2(X1,X2)|~c2_2(X1,a52))).
% 0.20/0.38 cnf(i_0_136, negated_conjecture, (c1_0|c5_1(X1)|c3_1(X1)|c4_2(X1,X2)|c4_2(a50,X3)|c3_2(a50,X3)|~ndr1_0|~ndr1_1(X1)|~ndr1_1(a50)|~c3_2(X1,X2)|~c2_2(a50,X3))).
% 0.20/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.20/0.38 # Begin printing tableau
% 0.20/0.38 # Found 4 steps
% 0.20/0.38 cnf(i_0_75, negated_conjecture, (c2_0|ndr1_1(a65)), inference(start_rule)).
% 0.20/0.38 cnf(i_0_390, plain, (ndr1_1(a65)), inference(closure_rule, [i_0_0])).
% 0.20/0.38 cnf(i_0_389, plain, (c2_0), inference(extension_rule, [i_0_116])).
% 0.20/0.38 cnf(i_0_1862, plain, (~c4_0), inference(extension_rule, [i_0_135])).
% 0.20/0.38 # End printing tableau
% 0.20/0.38 # SZS output end
% 0.20/0.38 # Branches closed with saturation will be marked with an "s"
% 0.20/0.38 # Child (2773) has found a proof.
% 0.20/0.38
% 0.20/0.38 # Proof search is over...
% 0.20/0.38 # Freeing feature tree
%------------------------------------------------------------------------------