TSTP Solution File: KRS098+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KRS098+1 : TPTP v8.1.0. Released v3.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 : n029.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 : Sun Jul 17 03:00:32 EDT 2022
% Result : Unsatisfiable 0.19s 0.41s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS098+1 : TPTP v8.1.0. Released v3.1.0.
% 0.00/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 7 20:12:50 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.39 # No SInE strategy applied
% 0.19/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.19/0.39 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.39 #
% 0.19/0.39 # Presaturation interreduction done
% 0.19/0.39 # Number of axioms: 60 Number of unprocessed: 60
% 0.19/0.39 # Tableaux proof search.
% 0.19/0.39 # APR header successfully linked.
% 0.19/0.39 # Hello from C++
% 0.19/0.39 # The folding up rule is enabled...
% 0.19/0.39 # Local unification is enabled...
% 0.19/0.39 # Any saturation attempts will use folding labels...
% 0.19/0.39 # 60 beginning clauses after preprocessing and clausification
% 0.19/0.39 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.19/0.39 # No conjectures.
% 0.19/0.39 # There are 60 start rule candidates:
% 0.19/0.39 # Found 2 unit axioms.
% 0.19/0.39 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.39 # 60 start rule tableaux created.
% 0.19/0.39 # 58 extension rule candidate clauses
% 0.19/0.39 # 2 unit axiom clauses
% 0.19/0.39
% 0.19/0.39 # Requested 8, 32 cores available to the main process.
% 0.19/0.41 # There were 1 total branch saturation attempts.
% 0.19/0.41 # There were 0 of these attempts blocked.
% 0.19/0.41 # There were 0 deferred branch saturation attempts.
% 0.19/0.41 # There were 0 free duplicated saturations.
% 0.19/0.41 # There were 1 total successful branch saturations.
% 0.19/0.41 # There were 0 successful branch saturations in interreduction.
% 0.19/0.41 # There were 0 successful branch saturations on the branch.
% 0.19/0.41 # There were 1 successful branch saturations after the branch.
% 0.19/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.41 # Begin clausification derivation
% 0.19/0.41
% 0.19/0.41 # End clausification derivation
% 0.19/0.41 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.41 cnf(i_0_41, plain, (cUnsatisfiable(i2003_11_14_17_20_25524))).
% 0.19/0.41 cnf(i_0_26, plain, (~cowlNothing(X1))).
% 0.19/0.41 cnf(i_0_42, plain, (~cd(X1)|~cc(X1))).
% 0.19/0.41 cnf(i_0_43, plain, (~ce(X1)|~cc(X1))).
% 0.19/0.41 cnf(i_0_44, plain, (~ce(X1)|~cd(X1))).
% 0.19/0.41 cnf(i_0_28, plain, (xsd_string(X1)|xsd_integer(X1))).
% 0.19/0.41 cnf(i_0_39, plain, (ca(X1)|~cc(X1))).
% 0.19/0.41 cnf(i_0_29, plain, (~xsd_string(X1)|~xsd_integer(X1))).
% 0.19/0.41 cnf(i_0_37, plain, (epred1_1(X1)|~cUnsatisfiable(X1))).
% 0.19/0.41 cnf(i_0_38, plain, (ca(X1)|~cd(X1))).
% 0.19/0.41 cnf(i_0_45, plain, (rr(X1,X2)|~rr1(X1,X2))).
% 0.19/0.41 cnf(i_0_33, plain, (cc(esk2_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.41 cnf(i_0_79, plain, (cd(esk8_1(X1))|~epred1_1(X1))).
% 0.19/0.41 cnf(i_0_84, plain, (ce(esk6_1(X1))|~epred1_1(X1))).
% 0.19/0.41 cnf(i_0_47, plain, (rtt(X1,X2)|~rt1(X1,X2))).
% 0.19/0.41 cnf(i_0_48, plain, (rtt(X1,X2)|~rt2(X1,X2))).
% 0.19/0.41 cnf(i_0_40, plain, (cd(X1)|cc(X1)|~ca(X1))).
% 0.19/0.41 cnf(i_0_46, plain, (rr(X1,X2)|~rr2(X1,X2))).
% 0.19/0.41 cnf(i_0_50, plain, (rtt(X1,X2)|~rt3(X1,X2))).
% 0.19/0.41 cnf(i_0_49, plain, (rr(X1,X2)|~rr3(X1,X2))).
% 0.19/0.41 cnf(i_0_36, plain, (rr1(X1,esk1_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.41 cnf(i_0_82, plain, (rr2(X1,esk7_1(X1))|~epred1_1(X1))).
% 0.19/0.41 cnf(i_0_86, plain, (rr3(X1,esk5_1(X1))|~epred1_1(X1))).
% 0.19/0.41 cnf(i_0_34, plain, (rt1(esk1_1(X1),esk2_1(X1))|~cUnsatisfiable(X1))).
% 0.19/0.41 cnf(i_0_80, plain, (rt2(esk7_1(X1),esk8_1(X1))|~epred1_1(X1))).
% 0.19/0.41 cnf(i_0_85, plain, (rt3(esk5_1(X1),esk6_1(X1))|~epred1_1(X1))).
% 0.19/0.41 cnf(i_0_35, plain, (X1=X2|~rtt(esk1_1(X3),X2)|~rtt(esk1_1(X3),X1)|~cUnsatisfiable(X3))).
% 0.19/0.41 cnf(i_0_78, plain, (X1=X2|~epred1_1(X3)|~rr(X3,X2)|~rr(X3,X1))).
% 0.19/0.41 cnf(i_0_83, plain, (X1=X2|~epred1_1(X3)|~rtt(esk5_1(X3),X2)|~rtt(esk5_1(X3),X1))).
% 0.19/0.41 cnf(i_0_81, plain, (X1=X2|~epred1_1(X3)|~rtt(esk7_1(X3),X2)|~rtt(esk7_1(X3),X1))).
% 0.19/0.41 cnf(i_0_30, plain, (cUnsatisfiable(X1)|esk4_2(X1,X2)!=esk3_2(X1,X2)|~epred1_1(X1)|~rt1(X2,X3)|~rr1(X1,X2)|~cc(X3))).
% 0.19/0.41 cnf(i_0_32, plain, (rtt(X1,esk3_2(X2,X1))|cUnsatisfiable(X2)|~epred1_1(X2)|~rt1(X1,X3)|~rr1(X2,X1)|~cc(X3))).
% 0.19/0.41 cnf(i_0_31, plain, (rtt(X1,esk4_2(X2,X1))|cUnsatisfiable(X2)|~epred1_1(X2)|~rt1(X1,X3)|~rr1(X2,X1)|~cc(X3))).
% 0.19/0.41 cnf(i_0_51, plain, (epred1_1(X1)|esk10_2(X1,X2)!=esk9_2(X1,X2)|esk12_2(X1,X3)!=esk11_2(X1,X3)|esk14_1(X1)!=esk13_1(X1)|~rt3(X2,X4)|~rt2(X3,X5)|~rr3(X1,X2)|~rr2(X1,X3)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_69, plain, (epred1_1(X1)|rtt(X2,esk9_2(X1,X2))|esk12_2(X1,X3)!=esk11_2(X1,X3)|esk14_1(X1)!=esk13_1(X1)|~rt3(X2,X4)|~rt2(X3,X5)|~rr3(X1,X2)|~rr2(X1,X3)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_60, plain, (epred1_1(X1)|rtt(X2,esk10_2(X1,X2))|esk12_2(X1,X3)!=esk11_2(X1,X3)|esk14_1(X1)!=esk13_1(X1)|~rt3(X2,X4)|~rt2(X3,X5)|~rr3(X1,X2)|~rr2(X1,X3)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_57, plain, (epred1_1(X1)|rtt(X2,esk11_2(X1,X2))|esk10_2(X1,X3)!=esk9_2(X1,X3)|esk14_1(X1)!=esk13_1(X1)|~rt3(X3,X4)|~rt2(X2,X5)|~rr3(X1,X3)|~rr2(X1,X2)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_54, plain, (epred1_1(X1)|rtt(X2,esk12_2(X1,X2))|esk10_2(X1,X3)!=esk9_2(X1,X3)|esk14_1(X1)!=esk13_1(X1)|~rt3(X3,X4)|~rt2(X2,X5)|~rr3(X1,X3)|~rr2(X1,X2)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_75, plain, (epred1_1(X1)|rtt(X2,esk11_2(X1,X2))|rtt(X3,esk9_2(X1,X3))|esk14_1(X1)!=esk13_1(X1)|~rt3(X3,X4)|~rt2(X2,X5)|~rr3(X1,X3)|~rr2(X1,X2)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_72, plain, (epred1_1(X1)|rtt(X2,esk12_2(X1,X2))|rtt(X3,esk9_2(X1,X3))|esk14_1(X1)!=esk13_1(X1)|~rt3(X3,X4)|~rt2(X2,X5)|~rr3(X1,X3)|~rr2(X1,X2)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_53, plain, (epred1_1(X1)|rr(X1,esk13_1(X1))|esk10_2(X1,X2)!=esk9_2(X1,X2)|esk12_2(X1,X3)!=esk11_2(X1,X3)|~rt3(X2,X4)|~rt2(X3,X5)|~rr3(X1,X2)|~rr2(X1,X3)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_52, plain, (epred1_1(X1)|rr(X1,esk14_1(X1))|esk10_2(X1,X2)!=esk9_2(X1,X2)|esk12_2(X1,X3)!=esk11_2(X1,X3)|~rt3(X2,X4)|~rt2(X3,X5)|~rr3(X1,X2)|~rr2(X1,X3)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_66, plain, (epred1_1(X1)|rtt(X2,esk11_2(X1,X2))|rtt(X3,esk10_2(X1,X3))|esk14_1(X1)!=esk13_1(X1)|~rt3(X3,X4)|~rt2(X2,X5)|~rr3(X1,X3)|~rr2(X1,X2)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_63, plain, (epred1_1(X1)|rtt(X2,esk12_2(X1,X2))|rtt(X3,esk10_2(X1,X3))|esk14_1(X1)!=esk13_1(X1)|~rt3(X3,X4)|~rt2(X2,X5)|~rr3(X1,X3)|~rr2(X1,X2)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_71, plain, (epred1_1(X1)|rtt(X2,esk9_2(X1,X2))|rr(X1,esk13_1(X1))|esk12_2(X1,X3)!=esk11_2(X1,X3)|~rt3(X2,X4)|~rt2(X3,X5)|~rr3(X1,X2)|~rr2(X1,X3)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_62, plain, (epred1_1(X1)|rtt(X2,esk10_2(X1,X2))|rr(X1,esk13_1(X1))|esk12_2(X1,X3)!=esk11_2(X1,X3)|~rt3(X2,X4)|~rt2(X3,X5)|~rr3(X1,X2)|~rr2(X1,X3)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_59, plain, (epred1_1(X1)|rtt(X2,esk11_2(X1,X2))|rr(X1,esk13_1(X1))|esk10_2(X1,X3)!=esk9_2(X1,X3)|~rt3(X3,X4)|~rt2(X2,X5)|~rr3(X1,X3)|~rr2(X1,X2)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_56, plain, (epred1_1(X1)|rtt(X2,esk12_2(X1,X2))|rr(X1,esk13_1(X1))|esk10_2(X1,X3)!=esk9_2(X1,X3)|~rt3(X3,X4)|~rt2(X2,X5)|~rr3(X1,X3)|~rr2(X1,X2)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_70, plain, (epred1_1(X1)|rtt(X2,esk9_2(X1,X2))|rr(X1,esk14_1(X1))|esk12_2(X1,X3)!=esk11_2(X1,X3)|~rt3(X2,X4)|~rt2(X3,X5)|~rr3(X1,X2)|~rr2(X1,X3)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_77, plain, (epred1_1(X1)|rtt(X2,esk11_2(X1,X2))|rtt(X3,esk9_2(X1,X3))|rr(X1,esk13_1(X1))|~rt3(X3,X4)|~rt2(X2,X5)|~rr3(X1,X3)|~rr2(X1,X2)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_61, plain, (epred1_1(X1)|rtt(X2,esk10_2(X1,X2))|rr(X1,esk14_1(X1))|esk12_2(X1,X3)!=esk11_2(X1,X3)|~rt3(X2,X4)|~rt2(X3,X5)|~rr3(X1,X2)|~rr2(X1,X3)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_58, plain, (epred1_1(X1)|rtt(X2,esk11_2(X1,X2))|rr(X1,esk14_1(X1))|esk10_2(X1,X3)!=esk9_2(X1,X3)|~rt3(X3,X4)|~rt2(X2,X5)|~rr3(X1,X3)|~rr2(X1,X2)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_55, plain, (epred1_1(X1)|rtt(X2,esk12_2(X1,X2))|rr(X1,esk14_1(X1))|esk10_2(X1,X3)!=esk9_2(X1,X3)|~rt3(X3,X4)|~rt2(X2,X5)|~rr3(X1,X3)|~rr2(X1,X2)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_74, plain, (epred1_1(X1)|rtt(X2,esk12_2(X1,X2))|rtt(X3,esk9_2(X1,X3))|rr(X1,esk13_1(X1))|~rt3(X3,X4)|~rt2(X2,X5)|~rr3(X1,X3)|~rr2(X1,X2)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_68, plain, (epred1_1(X1)|rtt(X2,esk11_2(X1,X2))|rtt(X3,esk10_2(X1,X3))|rr(X1,esk13_1(X1))|~rt3(X3,X4)|~rt2(X2,X5)|~rr3(X1,X3)|~rr2(X1,X2)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_65, plain, (epred1_1(X1)|rtt(X2,esk12_2(X1,X2))|rtt(X3,esk10_2(X1,X3))|rr(X1,esk13_1(X1))|~rt3(X3,X4)|~rt2(X2,X5)|~rr3(X1,X3)|~rr2(X1,X2)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_76, plain, (epred1_1(X1)|rtt(X2,esk11_2(X1,X2))|rtt(X3,esk9_2(X1,X3))|rr(X1,esk14_1(X1))|~rt3(X3,X4)|~rt2(X2,X5)|~rr3(X1,X3)|~rr2(X1,X2)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_73, plain, (epred1_1(X1)|rtt(X2,esk12_2(X1,X2))|rtt(X3,esk9_2(X1,X3))|rr(X1,esk14_1(X1))|~rt3(X3,X4)|~rt2(X2,X5)|~rr3(X1,X3)|~rr2(X1,X2)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_67, plain, (epred1_1(X1)|rtt(X2,esk11_2(X1,X2))|rtt(X3,esk10_2(X1,X3))|rr(X1,esk14_1(X1))|~rt3(X3,X4)|~rt2(X2,X5)|~rr3(X1,X3)|~rr2(X1,X2)|~ce(X4)|~cd(X5))).
% 0.19/0.41 cnf(i_0_64, plain, (epred1_1(X1)|rtt(X2,esk12_2(X1,X2))|rtt(X3,esk10_2(X1,X3))|rr(X1,esk14_1(X1))|~rt3(X3,X4)|~rt2(X2,X5)|~rr3(X1,X3)|~rr2(X1,X2)|~ce(X4)|~cd(X5))).
% 0.19/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.41 # Begin printing tableau
% 0.19/0.41 # Found 4 steps
% 0.19/0.41 cnf(i_0_41, plain, (cUnsatisfiable(i2003_11_14_17_20_25524)), inference(start_rule)).
% 0.19/0.41 cnf(i_0_87, plain, (cUnsatisfiable(i2003_11_14_17_20_25524)), inference(extension_rule, [i_0_37])).
% 0.19/0.41 cnf(i_0_454, plain, (epred1_1(i2003_11_14_17_20_25524)), inference(extension_rule, [i_0_79])).
% 0.19/0.41 cnf(i_0_474, plain, (cd(esk8_1(i2003_11_14_17_20_25524))), inference(etableau_closure_rule, [i_0_474, ...])).
% 0.19/0.41 # End printing tableau
% 0.19/0.41 # SZS output end
% 0.19/0.41 # Branches closed with saturation will be marked with an "s"
% 0.19/0.41 # There were 2 total branch saturation attempts.
% 0.19/0.41 # There were 0 of these attempts blocked.
% 0.19/0.41 # There were 0 deferred branch saturation attempts.
% 0.19/0.41 # There were 0 free duplicated saturations.
% 0.19/0.41 # There were 2 total successful branch saturations.
% 0.19/0.41 # There were 1 successful branch saturations in interreduction.
% 0.19/0.41 # There were 0 successful branch saturations on the branch.
% 0.19/0.41 # There were 1 successful branch saturations after the branch.
% 0.19/0.41 # Child (19782) has found a proof.
% 0.19/0.41 # There were 2 total branch saturation attempts.
% 0.19/0.41 # There were 0 of these attempts blocked.
% 0.19/0.41 # There were 0 deferred branch saturation attempts.
% 0.19/0.41 # There were 0 free duplicated saturations.
% 0.19/0.41 # There were 2 total successful branch saturations.
% 0.19/0.41 # There were 1 successful branch saturations in interreduction.
% 0.19/0.41 # There were 0 successful branch saturations on the branch.
% 0.19/0.41 # There were 1 successful branch saturations after the branch.
% 0.19/0.41
% 0.19/0.41 # Proof search is over...
% 0.19/0.41 # Freeing feature tree
%------------------------------------------------------------------------------