TSTP Solution File: KRS099+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KRS099+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 : n026.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.20s 0.38s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS099+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/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 : n026.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 09:17:46 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.37 # No SInE strategy applied
% 0.13/0.37 # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.13/0.37 # and selection function SelectNewComplexAHP.
% 0.13/0.37 #
% 0.13/0.37 # Presaturation interreduction done
% 0.13/0.37 # Number of axioms: 33 Number of unprocessed: 32
% 0.13/0.37 # Tableaux proof search.
% 0.13/0.37 # APR header successfully linked.
% 0.13/0.37 # Hello from C++
% 0.13/0.37 # The folding up rule is enabled...
% 0.13/0.37 # Local unification is enabled...
% 0.13/0.37 # Any saturation attempts will use folding labels...
% 0.13/0.37 # 32 beginning clauses after preprocessing and clausification
% 0.13/0.37 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.13/0.37 # No conjectures.
% 0.13/0.37 # There are 32 start rule candidates:
% 0.13/0.37 # Found 2 unit axioms.
% 0.13/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.13/0.37 # 32 start rule tableaux created.
% 0.13/0.37 # 30 extension rule candidate clauses
% 0.13/0.37 # 2 unit axiom clauses
% 0.13/0.37
% 0.13/0.37 # Requested 8, 32 cores available to the main process.
% 0.20/0.38 # There were 2 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 2 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 2 successful branch saturations after the branch.
% 0.20/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.38 # SZS output start for /export/starexec/sandbox2/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_44, plain, (cUnsatisfiable(i2003_11_14_17_20_29215))).
% 0.20/0.38 cnf(i_0_11, plain, (~cowlNothing(X1))).
% 0.20/0.38 cnf(i_0_43, plain, (~cd(X1)|~cc(X1))).
% 0.20/0.38 cnf(i_0_14, plain, (~xsd_string(X1)|~xsd_integer(X1))).
% 0.20/0.38 cnf(i_0_38, plain, (esk2_1(X1)!=esk1_1(X1)|~cUnsatisfiable(X1))).
% 0.20/0.38 cnf(i_0_13, plain, (xsd_string(X1)|xsd_integer(X1))).
% 0.20/0.38 cnf(i_0_41, plain, (rtt(X1,esk1_1(X1))|~cUnsatisfiable(X1))).
% 0.20/0.38 cnf(i_0_37, plain, (esk3_1(X1)!=esk1_1(X1)|~cUnsatisfiable(X1))).
% 0.20/0.38 cnf(i_0_36, plain, (esk3_1(X1)!=esk2_1(X1)|~cUnsatisfiable(X1))).
% 0.20/0.38 cnf(i_0_40, plain, (rtt(X1,esk2_1(X1))|~cUnsatisfiable(X1))).
% 0.20/0.38 cnf(i_0_39, plain, (rtt(X1,esk3_1(X1))|~cUnsatisfiable(X1))).
% 0.20/0.38 cnf(i_0_42, plain, (cd(X1)|cc(X1)|~ca(X1))).
% 0.20/0.38 cnf(i_0_35, plain, (ca(X1)|~rtt(X2,X1)|~cUnsatisfiable(X2))).
% 0.20/0.38 cnf(i_0_33, plain, (X1=X2|~rtt(X3,X2)|~rtt(X3,X1)|~cUnsatisfiable(X3))).
% 0.20/0.38 cnf(i_0_15, plain, (X1=X2|X1=X3|X2=X3|esk6_1(X4)!=esk5_1(X4)|esk8_1(X4)!=esk7_1(X4)|~rtt(X4,X3)|~rtt(X4,X2)|~rtt(X4,X1)|~ca(esk4_1(X4)))).
% 0.20/0.38 cnf(i_0_24, plain, (X1=X2|X1=X3|X2=X3|rtt(X4,esk4_1(X4))|esk6_1(X4)!=esk5_1(X4)|esk8_1(X4)!=esk7_1(X4)|~rtt(X4,X3)|~rtt(X4,X2)|~rtt(X4,X1))).
% 0.20/0.38 cnf(i_0_21, plain, (X1=X2|X1=X3|X2=X3|rtt(X4,esk5_1(X4))|esk8_1(X4)!=esk7_1(X4)|~rtt(X4,X3)|~rtt(X4,X2)|~rtt(X4,X1)|~ca(esk4_1(X4)))).
% 0.20/0.38 cnf(i_0_18, plain, (X1=X2|X1=X3|X2=X3|rtt(X4,esk6_1(X4))|esk8_1(X4)!=esk7_1(X4)|~rtt(X4,X3)|~rtt(X4,X2)|~rtt(X4,X1)|~ca(esk4_1(X4)))).
% 0.20/0.38 cnf(i_0_17, plain, (X1=X2|X1=X3|X2=X3|rtt(X4,esk7_1(X4))|esk6_1(X4)!=esk5_1(X4)|~rtt(X4,X3)|~rtt(X4,X2)|~rtt(X4,X1)|~ca(esk4_1(X4)))).
% 0.20/0.38 cnf(i_0_16, plain, (X1=X2|X1=X3|X2=X3|rtt(X4,esk8_1(X4))|esk6_1(X4)!=esk5_1(X4)|~rtt(X4,X3)|~rtt(X4,X2)|~rtt(X4,X1)|~ca(esk4_1(X4)))).
% 0.20/0.38 cnf(i_0_23, plain, (X1=X2|X1=X3|X2=X3|rtt(X4,esk7_1(X4))|rtt(X4,esk5_1(X4))|~rtt(X4,X3)|~rtt(X4,X2)|~rtt(X4,X1)|~ca(esk4_1(X4)))).
% 0.20/0.38 cnf(i_0_30, plain, (X1=X2|X1=X3|X2=X3|rtt(X4,esk5_1(X4))|rtt(X4,esk4_1(X4))|esk8_1(X4)!=esk7_1(X4)|~rtt(X4,X3)|~rtt(X4,X2)|~rtt(X4,X1))).
% 0.20/0.38 cnf(i_0_27, plain, (X1=X2|X1=X3|X2=X3|rtt(X4,esk6_1(X4))|rtt(X4,esk4_1(X4))|esk8_1(X4)!=esk7_1(X4)|~rtt(X4,X3)|~rtt(X4,X2)|~rtt(X4,X1))).
% 0.20/0.38 cnf(i_0_26, plain, (X1=X2|X1=X3|X2=X3|rtt(X4,esk7_1(X4))|rtt(X4,esk4_1(X4))|esk6_1(X4)!=esk5_1(X4)|~rtt(X4,X3)|~rtt(X4,X2)|~rtt(X4,X1))).
% 0.20/0.38 cnf(i_0_25, plain, (X1=X2|X1=X3|X2=X3|rtt(X4,esk8_1(X4))|rtt(X4,esk4_1(X4))|esk6_1(X4)!=esk5_1(X4)|~rtt(X4,X3)|~rtt(X4,X2)|~rtt(X4,X1))).
% 0.20/0.38 cnf(i_0_22, plain, (X1=X2|X1=X3|X2=X3|rtt(X4,esk8_1(X4))|rtt(X4,esk5_1(X4))|~rtt(X4,X3)|~rtt(X4,X2)|~rtt(X4,X1)|~ca(esk4_1(X4)))).
% 0.20/0.38 cnf(i_0_20, plain, (X1=X2|X1=X3|X2=X3|rtt(X4,esk7_1(X4))|rtt(X4,esk6_1(X4))|~rtt(X4,X3)|~rtt(X4,X2)|~rtt(X4,X1)|~ca(esk4_1(X4)))).
% 0.20/0.38 cnf(i_0_19, plain, (X1=X2|X1=X3|X2=X3|rtt(X4,esk8_1(X4))|rtt(X4,esk6_1(X4))|~rtt(X4,X3)|~rtt(X4,X2)|~rtt(X4,X1)|~ca(esk4_1(X4)))).
% 0.20/0.38 cnf(i_0_32, plain, (X1=X2|X1=X3|X2=X3|rtt(X4,esk7_1(X4))|rtt(X4,esk5_1(X4))|rtt(X4,esk4_1(X4))|~rtt(X4,X3)|~rtt(X4,X2)|~rtt(X4,X1))).
% 0.20/0.38 cnf(i_0_31, plain, (X1=X2|X1=X3|X2=X3|rtt(X4,esk8_1(X4))|rtt(X4,esk5_1(X4))|rtt(X4,esk4_1(X4))|~rtt(X4,X3)|~rtt(X4,X2)|~rtt(X4,X1))).
% 0.20/0.38 cnf(i_0_29, plain, (X1=X2|X1=X3|X2=X3|rtt(X4,esk7_1(X4))|rtt(X4,esk6_1(X4))|rtt(X4,esk4_1(X4))|~rtt(X4,X3)|~rtt(X4,X2)|~rtt(X4,X1))).
% 0.20/0.38 cnf(i_0_28, plain, (X1=X2|X1=X3|X2=X3|rtt(X4,esk8_1(X4))|rtt(X4,esk6_1(X4))|rtt(X4,esk4_1(X4))|~rtt(X4,X3)|~rtt(X4,X2)|~rtt(X4,X1))).
% 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 6 steps
% 0.20/0.38 cnf(i_0_44, plain, (cUnsatisfiable(i2003_11_14_17_20_29215)), inference(start_rule)).
% 0.20/0.38 cnf(i_0_45, plain, (cUnsatisfiable(i2003_11_14_17_20_29215)), inference(extension_rule, [i_0_38])).
% 0.20/0.38 cnf(i_0_241, plain, (esk2_1(i2003_11_14_17_20_29215)!=esk1_1(i2003_11_14_17_20_29215)), inference(extension_rule, [i_0_33])).
% 0.20/0.38 cnf(i_0_268, plain, (~cUnsatisfiable(i2003_11_14_17_20_29215)), inference(closure_rule, [i_0_44])).
% 0.20/0.38 cnf(i_0_266, plain, (~rtt(i2003_11_14_17_20_29215,esk1_1(i2003_11_14_17_20_29215))), inference(etableau_closure_rule, [i_0_266, ...])).
% 0.20/0.38 cnf(i_0_267, plain, (~rtt(i2003_11_14_17_20_29215,esk2_1(i2003_11_14_17_20_29215))), inference(etableau_closure_rule, [i_0_267, ...])).
% 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 (13794) has found a proof.
% 0.20/0.38
% 0.20/0.38 # Proof search is over...
% 0.20/0.38 # Freeing feature tree
%------------------------------------------------------------------------------