TSTP Solution File: KRS123+1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : KRS123+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 : n022.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:36 EDT 2022
% Result : Unsatisfiable 0.19s 0.38s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS123+1 : TPTP v8.1.0. Released v3.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 : n022.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 Jun 7 05:26:20 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.37 # No SInE strategy applied
% 0.19/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.37 #
% 0.19/0.37 # Presaturation interreduction done
% 0.19/0.37 # Number of axioms: 20 Number of unprocessed: 20
% 0.19/0.37 # Tableaux proof search.
% 0.19/0.37 # APR header successfully linked.
% 0.19/0.37 # Hello from C++
% 0.19/0.37 # The folding up rule is enabled...
% 0.19/0.37 # Local unification is enabled...
% 0.19/0.37 # Any saturation attempts will use folding labels...
% 0.19/0.37 # 20 beginning clauses after preprocessing and clausification
% 0.19/0.37 # No conjectures after preprocessing. Attempting to resurrect them from ax_archive.
% 0.19/0.37 # No conjectures.
% 0.19/0.37 # There are 20 start rule candidates:
% 0.19/0.37 # Found 2 unit axioms.
% 0.19/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.19/0.37 # 20 start rule tableaux created.
% 0.19/0.37 # 18 extension rule candidate clauses
% 0.19/0.37 # 2 unit axiom clauses
% 0.19/0.37
% 0.19/0.37 # Requested 8, 32 cores available to the main process.
% 0.19/0.38 # Closed tableau found in foldup close cycle with 2 folds and 1 closures done.
% 0.19/0.38 # There were 0 total branch saturation attempts.
% 0.19/0.38 # There were 0 of these attempts blocked.
% 0.19/0.38 # There were 0 deferred branch saturation attempts.
% 0.19/0.38 # There were 0 free duplicated saturations.
% 0.19/0.38 # There were 0 total successful branch saturations.
% 0.19/0.38 # There were 0 successful branch saturations in interreduction.
% 0.19/0.38 # There were 0 successful branch saturations on the branch.
% 0.19/0.38 # There were 0 successful branch saturations after the branch.
% 0.19/0.38 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.38 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.38 # Begin clausification derivation
% 0.19/0.38
% 0.19/0.38 # End clausification derivation
% 0.19/0.38 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.38 cnf(i_0_21, plain, (cUnsatisfiable(i2003_11_14_17_22_02803))).
% 0.19/0.38 cnf(i_0_1, plain, (~cowlNothing(X1))).
% 0.19/0.38 cnf(i_0_4, plain, (~xsd_integer(X1)|~xsd_string(X1))).
% 0.19/0.38 cnf(i_0_19, plain, (cc(X1)|~ce3(X1))).
% 0.19/0.38 cnf(i_0_6, plain, (cd(X1)|~cUnsatisfiable(X1))).
% 0.19/0.38 cnf(i_0_3, plain, (xsd_integer(X1)|xsd_string(X1))).
% 0.19/0.38 cnf(i_0_7, plain, (cc(X1)|~cUnsatisfiable(X1))).
% 0.19/0.38 cnf(i_0_12, plain, (~ra_Px1(X1,X2)|~cd(X1))).
% 0.19/0.38 cnf(i_0_20, plain, (cd(X1)|~cf(X1))).
% 0.19/0.38 cnf(i_0_9, plain, (cd1xcomp(X1)|~cc1(X1))).
% 0.19/0.38 cnf(i_0_10, plain, (cd1(X1)|~cc1(X1))).
% 0.19/0.38 cnf(i_0_8, plain, (cdxcomp(X1)|~cc(X1))).
% 0.19/0.38 cnf(i_0_18, plain, (~ra_Px2(X1,X2)|~cd1xcomp(X1))).
% 0.19/0.38 cnf(i_0_5, plain, (cUnsatisfiable(X1)|~cd(X1)|~cc(X1))).
% 0.19/0.38 cnf(i_0_13, plain, (cdxcomp(X1)|~ra_Px1(X1,X2))).
% 0.19/0.38 cnf(i_0_15, plain, (cd1(X1)|~ra_Px2(X1,X2))).
% 0.19/0.38 cnf(i_0_11, plain, (ra_Px1(X1,esk1_1(X1))|cd(X1))).
% 0.19/0.38 cnf(i_0_17, plain, (ra_Px2(X1,esk4_1(X1))|cd1xcomp(X1))).
% 0.19/0.38 cnf(i_0_14, plain, (ra_Px1(X1,esk2_1(X1))|~cdxcomp(X1))).
% 0.19/0.38 cnf(i_0_16, plain, (ra_Px2(X1,esk3_1(X1))|~cd1(X1))).
% 0.19/0.38 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.38 # Begin printing tableau
% 0.19/0.38 # Found 7 steps
% 0.19/0.38 cnf(i_0_8, plain, (cdxcomp(i2003_11_14_17_22_02803)|~cc(i2003_11_14_17_22_02803)), inference(start_rule)).
% 0.19/0.38 cnf(i_0_42, plain, (cdxcomp(i2003_11_14_17_22_02803)), inference(extension_rule, [i_0_14])).
% 0.19/0.38 cnf(i_0_307, plain, (ra_Px1(i2003_11_14_17_22_02803,esk2_1(i2003_11_14_17_22_02803))), inference(extension_rule, [i_0_12])).
% 0.19/0.38 cnf(i_0_343, plain, (~cd(i2003_11_14_17_22_02803)), inference(extension_rule, [i_0_6])).
% 0.19/0.38 cnf(i_0_349, plain, (~cUnsatisfiable(i2003_11_14_17_22_02803)), inference(closure_rule, [i_0_21])).
% 0.19/0.38 cnf(i_0_43, plain, (~cc(i2003_11_14_17_22_02803)), inference(extension_rule, [i_0_7])).
% 0.19/0.38 cnf(i_0_396, plain, (~cUnsatisfiable(i2003_11_14_17_22_02803)), inference(closure_rule, [i_0_21])).
% 0.19/0.38 # End printing tableau
% 0.19/0.38 # SZS output end
% 0.19/0.38 # Branches closed with saturation will be marked with an "s"
% 0.19/0.38 # Child (8144) has found a proof.
% 0.19/0.38
% 0.19/0.38 # Proof search is over...
% 0.19/0.38 # Freeing feature tree
%------------------------------------------------------------------------------